Why We Need Semirings in Automata Theory (Extended Abstract)

  • Werner KuichEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9270)


In this lecture we will report on generalizations of some classical results on formal languages. These generalizations are achieved by an algebraic treatment using semirings, formal power series, fixed point theory and matrices. By the use of these mathematical constructs, definitions, constructions, and proofs are obtained that are very satisfactory from a mathematical point of view.


Power Series Point Theory Formal Language Formal Power Series Regular Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Baron, G., Kuich, W.: The characterization of nonexpansive grammars by rational power series. Inf. Control 48, 109–118 (1981)zbMATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    Berstel, J.: Transductions and Context-Free Languages. Teubner (1979)Google Scholar
  3. 3.
    Ésik, Z., Kuich, W.: On power series over a graded monoid. In: Calude, C.S., Freivalds, R., Kazuo, I. (eds.) Gruska Festschrift. LNCS, vol. 8808, pp. 49–55. Springer, Heidelberg (2014) Google Scholar
  4. 4.
    Flajolet, P.: Ambiguity and transcendence. In: Brauer, W. (ed.) Automata, Languages and Programming. LNCS, pp. 179–188. Springer, Heidelberg (1985) CrossRefGoogle Scholar
  5. 5.
    Harju, T., Karhumäki, J.: The equivalence problem of multitape finite automata. Theoretical Computer Science 78, 347–355 (1991)zbMATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    Kuich, W.: On the entropy of context-free languages. Inf. Control 16, 173–200 (1970)zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Kuich, W.: Forty years of formal power series in automata theory. In: Salomaa, A., Wood, D., Yu, S. (eds.) Half Century of Automata Theory, pp. 49–71. World Scientific (2001)Google Scholar
  8. 8.
    Kuich, W., Salomaa, A.: Semirings, Automata, Languages. Springer (1986)Google Scholar
  9. 9.
    Sakarovitch, J.: Rational and recognisable power series. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, Chapter 4, pp. 105–174. Springer (2009)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Technische Universität WienViennaAustria

Personalised recommendations