Skip to main content
SpringerLink
Log in
Book cover

Handbook of Formal Languages pp 609–677Cite as

Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata

  • Chapter
  • First Online:

Abstract

The purpose of Chapter 9 is to develop some classical results on formal languages and automata by an algebraic treatment using semirings, formal power series and matrices. The use of semirings, formal power series and matrices makes the proofs computational in nature and, consequently, more satisfactory from the mathematical point of view than the customary proofs.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Autebert, J. M., Flajolet, Ph., Gabarro, J.: Prefixes of infinite words and ambiguous context-free languages. Inf. Process. Lett. 25(1987) 211–216.

    MathSciNet  MATH  Google Scholar 

  2. Baron, G., Kuich, W.: The characterization of nonexpansive grammars by rational power series. Inf. Control 48(1981) 109–118.

    MathSciNet  MATH  Google Scholar 

  3. Berstel, J. (ed): Séries formelles en variables non commutatives et applications. Laboratoire d’Informatique Théorique et Programmation. Ecole Nationale Supérieure de Techniques Avancées, 1978.

    Google Scholar 

  4. Berstel, J.: Transductions and Context-Free Languages. Teubner, 1979.

    MATH  Google Scholar 

  5. Berstel, J.: Properties of infinite words: recent results. STACS89, Lect. Notes Comput. Sci. 349, Springer-Verlag 1989, 36–46.

    Google Scholar 

  6. Berstel, J., Boasson, L.: Context-free languages. In: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B. North-Holland, 1990, 59–102.

    Google Scholar 

  7. Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theor. Comput. Sci. 18(1982) 115–148.

    MathSciNet  MATH  Google Scholar 

  8. Berstel, J., Reutenauer, C.: Les séries rationelles et leurs langages. Masson, 1984. English translation: Rational Series and Their Languages. EATCS Mono-graphs on Theoretical Computer Science, Vol. 12. Springer-Verlag 1988.

    Google Scholar 

  9. Berstel, J., Reutenauer, C.: Zeta functions of formal languages. ICALP88, Lect. Notes Comput. Sci. 317, Springer-Verlag 1988, 93–104.

    Google Scholar 

  10. Bertoni, A., Goldwurm, M., Massazza, P.: Counting problems and algebraic formal power series in noncommuting variables. Inf. Proc. Lett. 34(1990) 117–121.

    MathSciNet  MATH  Google Scholar 

  11. Bertoni, A., Goldwurm, M., Sabadini, N.: The complexity of computing the number of strings of given length in context-free languages. Theor. Comp. Sci. 86(1991) 325–342.

    MATH  Google Scholar 

  12. Bloom, St. L., Ésik, Z.: Iteration Theories. EATCS Monographs on Theoretical Computer Science. Springer-Verlag 1993.

    Google Scholar 

  13. Bozapalidis, S.: Effective construction of the syntactic algebra of a recognizable series on trees. Acta Inf. 28(1991) 351–363.

    MathSciNet  MATH  Google Scholar 

  14. Bozapalidis, S.: Convex algebras, convex modules and formal power series on trees. Aristotle University of Thessaloniki, 1995.

    Google Scholar 

  15. Bozapalidis, S., Rahonis, G.: On two families of forests. Acta Inf. 31(1994) 235–260.

    MathSciNet  MATH  Google Scholar 

  16. Bucher, W., Maurer, H.: Theoretische Grundlagen der Programmiersprachen. B. I. Wissenschaftsverlag, 1984.

    MATH  Google Scholar 

  17. Carré, B.: Graphs and Networks. Clarendon Press, 1979.

    Google Scholar 

  18. Chomsky, N.: On certain formal properties of grammars. Inf. Control 2(1959) 137–167.

    MathSciNet  MATH  Google Scholar 

  19. Chomsky, N.: Context-free grammars and pushdown storage. MIT Res. Lab. of Elect., Quarterly Prog. Rep. 65(1962) 187–194.

    Google Scholar 

  20. Chomsky, N., Schützenberger, M. P.: The algebraic theory of context-free languages. In: P. Braffort and D. Hirschberg, eds., Computer Programming and Formal Systems. North-Holland, 1963, 118–161.

    Google Scholar 

  21. Conway, J. H.: Regular Algebra and Finite Machines. Chapman & Hall, 1971.

    Google Scholar 

  22. Cori, R., Richard, J.: Enumeration des graphes planaires à l’aide des series formelles en variables non commutatives. Discrete Math. 2(1972) 115–162.

    MathSciNet  MATH  Google Scholar 

  23. Culik II, K., Karhumäki, J.: A note on the equivalence problem of rational formal power series. Inf. Proc. Lett. 23(1986) 29–31.

    MathSciNet  MATH  Google Scholar 

  24. Diekert, V.: Transitive orientations, Möbius functions and complete semi-Thue systems for free partially commutative monoids. ICALP88, Lect. Notes Corn-put. Sci. 317, Springer-Verlag 1988, 176–187.

    Google Scholar 

  25. Eilenberg, S.: Automata, Languages and Machines. Vol. A. Academic Press, 1974.

    MATH  Google Scholar 

  26. Eilenberg, S.: Automata, Languages and Machines. Vol. C. Draft of Sections I-III, 1978.

    MATH  Google Scholar 

  27. Eilenberg, S., Schützenberger, M. P.: Rational sets in commutative monoids. J. Algebra 13(1969) 173–191.

    MathSciNet  MATH  Google Scholar 

  28. Fernau, H.: Valuations of languages, with applications to fractal geometry. Theor. Comput. Sci. 137(1995) 177–217.

    MathSciNet  MATH  Google Scholar 

  29. Flajolet, Ph.: Analyse d’algorithmes de manipulation d’arbres et de fichiers. Cahiers du BURO 34/35(1981) 1–209.

    Google Scholar 

  30. Flajolet, Ph.: Elements of a general theory of combinatorial structures. FCT85, Lect. Notes Comput. Sci. 199, Springer-Verlag 1985, 112–127.

    Google Scholar 

  31. Flajolet, Ph.: Ambiguity and transcendence. ICALP85, Lect. Notes Comput. Sci. 194, Springer-Verlag 1985, 179–188.

    Google Scholar 

  32. Flajolet, Ph.: Analytic models and ambiguity of context-free languages. Theor. Comput. Sci. 49(1987) 283–309.

    MathSciNet  MATH  Google Scholar 

  33. Flajolet, Ph.: Mathematical methods in the analysis of algorithms and data structures. In: E. Börger, ed., Trends in Theoretical Computer Science, Chapter 6. Computer Science Press, 1988, 225–304.

    Google Scholar 

  34. Flajolet, Ph.: Analytic analysis of algorithms. ICALP92, Lect. Notes Comput. Sci. 623, Springer-Verlag 1992, 186–210.

    Google Scholar 

  35. Flajolet, Ph., Gardy, D., Thimonier, L.: Birthday paradox, coupon collectors, caching algorithms and self-organizing search. Discrete Appl. Math. 39(1992) 207–229.

    MathSciNet  MATH  Google Scholar 

  36. Floyd, R. W.: Syntactic analysis and operator precedence. J. Assoc. Comput. Mach. 10(1963) 313–333.

    MATH  Google Scholar 

  37. Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland, 1975.

    Google Scholar 

  38. Ginsburg, S., Rice, H. G.: Two families of languages related to ALGOL. J. Assoc. Comput. Mach. 9(1962) 350–371.

    MathSciNet  MATH  Google Scholar 

  39. Ginsburg, S., Rozenberg, G.: TOL schemes and control sets. Inf. Control 27(1975) 109–125.

    MathSciNet  MATH  Google Scholar 

  40. Golan, J. S.: The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science. Pitman Monographs and Surveys in Pure and Applied Mathematics 54. Longman Sci. Tech., 1992.

    Google Scholar 

  41. Golan, J. S., Mateescu, A., Vaida, D.: Towards a unified theory of sequential parallel and semi-parallel processes. Technical report, 1995.

    Google Scholar 

  42. Goldman, J. R.: Formal languages and enumeration. J. Comb. Theory, Series A, 24(1978) 318–338.

    MathSciNet  MATH  Google Scholar 

  43. Goldstern, M.: Vervollständigung von Halbringen. Diplomarbeit, Technische Universität Wien, 1985.

    Google Scholar 

  44. Greibach, S.: A new normal-form theorem for context-free phrase structure grammars. J. Assoc. Comput. Mach. 12(1965) 42–52.

    MathSciNet  MATH  Google Scholar 

  45. Gross, M., Lentin, A.: Introduction to Formal Grammars. Springer-Verlag 1970.

    MATH  Google Scholar 

  46. Harrison, M. A.: Introduction to Formal Language Theory. Addison-Wesley, 1978.

    Google Scholar 

  47. Harju, T., Karhumäki, J.: The equivalence problem of multitape finite automata. Theor. Comput. Sci. 78(1991) 347–355.

    MathSciNet  MATH  Google Scholar 

  48. Hashiguchi, K.: Limitedness theorem for finite automata with distance functions. J. Comp. Syst. Sci. 24(1982) 233–244.

    MathSciNet  MATH  Google Scholar 

  49. Hashiguchi, K.: Algorithms for determining relative star height and star height. Inform. Comput. 78(1987) 124–169.

    MathSciNet  MATH  Google Scholar 

  50. Hashiguchi, K.: Impoved limitedness theorems on finite automata with distance functions. Theor. Comput. Sci. 72(1990) 27–38.

    MATH  Google Scholar 

  51. Hebisch, U.: The Kleene theorem in countably complete semirings. Bayreuther Mathematische Schriften, 31(1990) 55–66.

    MathSciNet  MATH  Google Scholar 

  52. Hebisch, U.: Eine algebraische Theorie unendlicher Summen mit Anwendungen auf Halbgruppen and Halbringe. Bayreuther Mathematische Schriften, 40(1992) 21–152.

    MathSciNet  MATH  Google Scholar 

  53. Hebisch, U., Weinert, H. J.: Halbringe. Teubner, 1993.

    MATH  Google Scholar 

  54. Honkala, J.: A necessary condition for the rationality of the zeta function of a regular language. Theor. Comput. Sci. 66(1989) 341–347.

    MathSciNet  MATH  Google Scholar 

  55. Honkala, J.: On algebraic generalized zeta functions of formal power series. Theor. Comput. Sci.79(1991) 263–273.

    MathSciNet  MATH  Google Scholar 

  56. Honkala, J.: On DOL systems with immigration. Theor. Comput. Sci. 120(1993) 229–245.

    MathSciNet  MATH  Google Scholar 

  57. Honkala, J.: On Lindenmayerian series in complete semirings. In: G. Rozenberg and A. Salomaa, eds., Developments in Language Theory. World Scientific, 1994, 179–192.

    Google Scholar 

  58. Honkala, J.: On morphically generated formal power series. Informatique théorique et Applications/Theoretical Informatics and Applications 29(1995) 105–127.

    MathSciNet  MATH  Google Scholar 

  59. Honkala, J.: On Lindenmayerian algebraic sequences. University of Turku, 1995.

    Google Scholar 

  60. Honkala, J.: On Parikh slender languages and power series. J. Comp. Syst. Sci., to appear.

    Google Scholar 

  61. Honkala, J.: On images of algebraic series. University of Turku, 1995.

    Google Scholar 

  62. Honkala, J., Kuich, W.: On a power series generalization of ETOL languages. Fundamenta Informaticae, to appear.

    Google Scholar 

  63. Honkala, J., Kuich, W.: On Lindenmayerian algebraic power series. University of Turku, 1995.

    MATH  Google Scholar 

  64. Hoperoft, J. E., Ullman, J. D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.

    Google Scholar 

  65. Ibarra, O. H., Ravikumar, B.: On sparseness, ambiguity and other decision problems for acceptors and transducers. STACS86, Lect. Notes Comput. Sci. 210, Springer-Verlag 1986, 171–179.

    Google Scholar 

  66. Jacob, G.: Sur un Théorème de Shamir. Inf. Control 27(1975) 218–261.

    MATH  Google Scholar 

  67. Jacob, G.: Représentations et substitutions matricielles dans la théorie algébrique des transductions. Thèse de doctorat d’état, Université Paris, VII, 1975.

    Google Scholar 

  68. Jacob, G.: La finitude des representations lineaires des semigroupes est decidable. J. Algebra 52(1978) 437–459.

    MathSciNet  MATH  Google Scholar 

  69. Karner, G.: On limits in complete semirings. Semigroup Forum 45(1992) 148–165.

    MathSciNet  MATH  Google Scholar 

  70. Karner, G.: Nivat’s Theorem for pushdown transducers. Theor. Comp. Sci. 97(1992) 245–262.

    MathSciNet  MATH  Google Scholar 

  71. Karner, G.: On transductions of formal power series over complete semirings. Theor. Comp. Sci. 98(1992) 27–39.

    MathSciNet  MATH  Google Scholar 

  72. Karner, G.: A topology for complete semirings. STACS 94, Lect. Notes Corn-put. Sci. 775, Springer-Verlag 1994, 389–400.

    Google Scholar 

  73. Kemp, R.: On the number of words in the language \({\left\{ {w \in {\Sigma ^*}\left| {w = {w^R}} \right.} \right\}^2}\) Discrete Math. 40(1980) 225–234.

    MathSciNet  Google Scholar 

  74. Kemp, R.: A note on the density of inherently ambiguous context-free languages. Acta Inf. 14(1980) 295–298.

    MathSciNet  MATH  Google Scholar 

  75. Krob, D.: Monoides et semi-anneaux continus. Semigroup Forum 37(1988) 59–78.

    MathSciNet  MATH  Google Scholar 

  76. Krob, D.: The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Int. J. of Algebra and Comput. 4(1994) 405–425.

    MathSciNet  MATH  Google Scholar 

  77. Kleene, St. C.: Representation of events in nerve nets and finite automata. In: C. E. Shannon, J. McCarthy, eds., Automata Studies. Princeton University Press, 1956, 3–41.

    Google Scholar 

  78. Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Computation 110(1994) 366–390.

    MathSciNet  MATH  Google Scholar 

  79. Kudlek, M., Mateescu, A.: On distributed catenation. Universität Hamburg, 1995.

    MATH  Google Scholar 

  80. Kuich, W.: Über die Entropie kontext-freier Sprachen. Habilitationsschrift, Technische Hochschule Wien, 1970. English translation: On the entropy of context-free languages. Inf. Control 16(1970) 173–200.

    Google Scholar 

  81. Kuich, W.: Languages and the enumeration of planted plane trees. Indagationes Mathematicae 32(1970) 268–280.

    MathSciNet  MATH  Google Scholar 

  82. Kuich, W.: Hauptkegel algebraischer Potenzreihen. EIK 23(1987) 147–170.

    MathSciNet  MATH  Google Scholar 

  83. Kuich, W.: The Kleene and the Parikh theorem in complete semirings. ICALP87, Lect. Notes Comput. Sci. 267, Springer-Verlag 1987, 212–225.

    MathSciNet  MATH  Google Scholar 

  84. Kuich, W.:ω-continuous semirings, algebraic systems and pushdown automata. ICALP90, Lect. Notes Comput. Sci. 443, Springer-Verlag 1990, 103–110.

    MathSciNet  Google Scholar 

  85. Kuich, W.: Automata and languages generalized to w-continuous semirings. Theor. Comput. Sci. 79(1991) 137–150.

    MathSciNet  MATH  Google Scholar 

  86. Kuich, W.: Automaten und Formale Sprachen. Skriptum, Technische Universität Wien, 1991.

    Google Scholar 

  87. Kuich, W.: Lindenmayer systems generalized to formal power series and their growth functions. In: G. Rozenberg and A. Salomaa, eds., Developments in Language Theory. World Scientific, 1994, 171–178.

    Google Scholar 

  88. Kuich, W.: The algebraic equivalent of AFL theory. ICALP95, Lect. Notes Comput. Sci. 944, Springer-Verlag 1995, 39–50.

    MathSciNet  Google Scholar 

  89. Kuich, W., Maurer, H.: The structure generating function and entropy of tuple languages. Inf. Control 19(1971) 195–203.

    MathSciNet  MATH  Google Scholar 

  90. Kuich, W., Maurer, H.: On the inherent ambiguity of simple tuple languages. Computing 7(1971) 194–203.

    MathSciNet  MATH  Google Scholar 

  91. Kuich, W., Prodinger, H., Urbanek, F.: On the height of derivation trees. ICALP79, Lect. Notes Comput. Sci. 71, Springer-Verlag 1979, 370–384.

    Google Scholar 

  92. Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, Vol. 5. Springer-Verlag 1986.

    Google Scholar 

  93. Kuich, W., Shyamasundar, R. K.: The structure generating function of some families of languages. Inf. Control 32(1976) 85–92.

    MathSciNet  MATH  Google Scholar 

  94. Kuich, W., Urbanek, F.: Infinite linear systems and one counter languages. Theor. Comput. Sci. 22(1983) 95–126.

    MathSciNet  MATH  Google Scholar 

  95. Küster, G.: Das Hadamardprodukt abstrakter Familien von Potenzreihen. Dissertation, Technische Universität Wien, 1986.

    Google Scholar 

  96. Lausch, H., Nöbauer, W.: Algebra of Polynomials. North-Holland, 1973.

    MATH  Google Scholar 

  97. Lehmann, D. J.: Algebraic structures for transitive closure. Theor. Comput. Sci. 4(1977) 59–76.

    MathSciNet  MATH  Google Scholar 

  98. Leung, H.: Limitedness theorem on finite automata with distance functions: an algebraic proof. Theor. Comput. Sci. 81(1991) 137–145.

    MathSciNet  MATH  Google Scholar 

  99. Leung, H.: A note on finitely ambiguous distance automata. Inform. Process. Lett. 44(1992) 329–331.

    MathSciNet  MATH  Google Scholar 

  100. Lindenmayer, A.: Mathematical models for cellular interactions in development, parts I, II. J. Theor. Biol. 18(1968) 280–315.

    Google Scholar 

  101. Litow, B.: A context-free language decision problem. Theor. Comput. Sci. 125(1994) 339–343.

    MathSciNet  MATH  Google Scholar 

  102. Litow, B.: Numbering unambiguous context-free languages. Austral. Comput. Sci. Commun. 16(1994) 373–378.

    MathSciNet  Google Scholar 

  103. Litow, B., Dumas, Ph.: Additive cellular automata and algebraic series. Theor. Comput. Sci. 119(1993) 345–354.

    MathSciNet  MATH  Google Scholar 

  104. Mahr, B.: Iteration and summability in semirings. Ann. of Discrete Math. 19(1984) 229–256.

    MathSciNet  MATH  Google Scholar 

  105. Mateescu, A.: On (left) partial shuffle. Lect. Notes Comput. Sci. 812, Springer-Verlag 1994, 264–278.

    Google Scholar 

  106. Matos, A. B.: Periodic sets of integers. Theor. Comput. Sci. 127(1994) 287–312.

    MathSciNet  MATH  Google Scholar 

  107. Moll, R. N., Arbib, M. A., Kfoury, A. J.: An Introduction to Formal Language Theory. Springer-Verlag 1988.

    Google Scholar 

  108. Nivat, M.: Transductions des langages de Chomsky. Ann. Inst. Fourier 18(1968) 339–455.

    MathSciNet  MATH  Google Scholar 

  109. Parikh, R. J.: On context-free languages. J. Assoc. Comput. Mach. 13(1966) 570–581.

    MathSciNet  MATH  Google Scholar 

  110. Paz, A.: Introduction to Probabilistic Automata. Academic Press, 1971.

    MATH  Google Scholar 

  111. Perrin, D.: Finite automata. In: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B. North-Holland, 1990, 1–57.

    Google Scholar 

  112. Petersen, H.: The ambiguity of primitive words. STACS 94, Lect. Notes Corn-put. Sci. 775, Springer-Verlag 1994, 679–690.

    Google Scholar 

  113. Pilling, D. L.: Commutative regular equations and Parikh’s theorem. J. Lond. Math. Soc., II. Ser. 6 (1973) 663–666.

    MathSciNet  MATH  Google Scholar 

  114. Reutenauer, C.: On a question of S. Eilenberg. Theor. Comput. Sci. 5(1977) 219.

    MATH  Google Scholar 

  115. Reutenauer, C.: Sur les séries rationelles en variables non commutatives. Lect. Notes Comput. Sci. 62, Springer-Verlag 1978, 372–381.

    Google Scholar 

  116. Reutenauer, C.: Sur les séries associées à certains systèmes de Lindenmayer. Theor. Comput. Sci. 9(1979) 363–375.

    MATH  Google Scholar 

  117. Reutenauer, C.: An Ogden-like iteration lemma for rational power series. Acta Inf. 13(1980) 189–197.

    MathSciNet  MATH  Google Scholar 

  118. Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, 1980.

    MATH  Google Scholar 

  119. Rosenkrantz, D. J.: Matrix equations and normal forms for context-free grammars. J. Assoc. Comput. Mach. 14(1967) 501–507.

    MathSciNet  MATH  Google Scholar 

  120. Salomaa, A.: Theory of Automata. Pergamon Press, 1969.

    MATH  Google Scholar 

  121. Salomaa, A.: Formal Languages. Academic Press, 1973.

    MATH  Google Scholar 

  122. Salomaa, A.: Formal languages and power series. In: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B. North-Holland, 1990, 103–132.

    Google Scholar 

  123. Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Springer-Verlag 1978.

    MATH  Google Scholar 

  124. Sakarovitch, J.: Kleene’s theorem revisited. Lect. Notes Comput. Sci. 281, Springer-Verlag 1987, 39–50.

    Google Scholar 

  125. Schützenberger, M. P.: Un problème de la théorie des automates. Seminaire Dubreil-Pisot, 13.3, Inst. H. Poincaré, 1960.

    Google Scholar 

  126. Schützenberger, M. P.: On the definition of a family of automata. Inf. Control 4(1961) 245–270.

    MathSciNet  MATH  Google Scholar 

  127. Schützenberger, M.P.: On a theorem of R. Jungen. Proc. Am. Math. Soc. 13(1962) 885–889.

    MathSciNet  MATH  Google Scholar 

  128. Schützenberger, M. P.: Certain elementary families of automata. In: Proceedings of the Symposium on Mathematical Theory of Automata, Polytechnic Institute of Brooklyn, 1962, 139–153.

    Google Scholar 

  129. Semenov, A. L.: Algoritmitgeskie problemy dlja stepennykh rjadov i kontekstnosvobodnykh grammatik. Dokl. Akad. Nauk SSSR 212(1973) 50–52.

    Google Scholar 

  130. Seneta, E.: Non-Negative Matrices and Markov Chains, Second Edition. Springer-Verlag 1981.

    MATH  Google Scholar 

  131. Shamir, E.: A representation theorem for algebraic and context-free power series in non-commuting variables. Inf. Control 11(1967) 239–254.

    MathSciNet  MATH  Google Scholar 

  132. Simon, I.: Recognizable sets with multiplicities in the tropical semiring. MFCS88, Lect. Notes Comput. Sci. 324, Springer-Verlag 1988, 107–120.

    Google Scholar 

  133. Simon, I.: On semigroups of matrices over the tropical semiring. Informatique théorique et Applications/Theoretical Informatics and Applications 28(1994) 277–294.

    MathSciNet  MATH  Google Scholar 

  134. Stearns, R. E.: A regularity test for pushdown machines. Inf. Control 11(1967) 323–340.

    MATH  Google Scholar 

  135. Ullian, J. S.: Partial algorithm problems for context-free languages. Inf. Control 11(1967) 80–101.

    MathSciNet  MATH  Google Scholar 

  136. Urbanek, F.: On Greibach normal form construction. Theor. Comput. Sci. 40(1985) 315–317.

    MathSciNet  MATH  Google Scholar 

  137. Weber, A.: Distance automata having large finite distance or finite ambiguity. Math. Systems Theory 26(1993) 169–185.

    MathSciNet  MATH  Google Scholar 

  138. Weber, A.: Finite-valued distance automata. Theor. Comput. Sci. 134(1994) 225–251.

    MathSciNet  MATH  Google Scholar 

  139. Weber, A.: Exponential upper and lower bounds for the order of a regular language. Theor. Comput. Sci. 134(1994) 253–262.

    MathSciNet  MATH  Google Scholar 

  140. Wechler, W.: The Concept of Fuzziness in Automata and Language Theory. Akademie-Verlag, 1978.

    MATH  Google Scholar 

  141. Wechler, W.: Universal Algebra for Computer Scientists. EATCS Monographs on Computer Science, Vol. 25. Springer-Verlag 1992.

    MATH  Google Scholar 

  142. Weinert, H. J.: Generalized semialgebras over semirings. Lect. Notes Math. 1320, Springer-Verlag 1988, 380–416.

    MathSciNet  MATH  Google Scholar 

Download references

Authors
  1. Werner Kuich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Leiden University, P.O. Box 9512, Leiden, RA, NL-2300, The Netherlands

    Grzegorz Rozenberg

  2. Turku Centre for Computer Science Data City, Turku, FIN-20520, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kuich, W. (1997). Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata. In: Rozenberg, G., Salomaa, A. (eds) Handbook of Formal Languages. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59136-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59136-5_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-63863-3

  • Online ISBN: 978-3-642-59136-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation