Kleene's theorem revisited

  • Jacques Sakarovitch
Chapter 1 VLSI And Formal Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 281)


The analysis of the famous Kleene's theorem shows that it consists indeed in two different propositions that are better distinguished when one tries to generatize the result. The first one relates rational expressions and a suitable generalization of finite automata. It holds in any monoid or, even better, in the semiring of formal power series on any monoid. It is shown that several classical results in formal language theory, for instance Elgot and Mezei characterization of rational relations by transducers and Chomsky normal form for context-free grammars, can thus be seen as particular cases of this first half of Kleene's theorem.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. Berstel, Transductions and Context free Languages, Teubner, 1979.Google Scholar
  2. 2.
    J. Berstel, Ch. Reutenauer, Les séries rationnelles et leurs languages, Masson, 1984.Google Scholar
  3. 3.
    J. H. Conway, Regular Algebra and Finite Machines, Chapman and Hall, 1971.Google Scholar
  4. 4.
    S. Eilenberg, Automata, languages, and Machines, Vol. A, Academic Press, 1974.Google Scholar
  5. 5.
    C. C. Elgot and G. Mezei, On relations defined by generalized finite automata, I.B.M. J. of Res. and Dev. 9, 1965, 47–65.Google Scholar
  6. 6.
    J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison Wesley, 1979.Google Scholar
  7. 7.
    J. E. Hopcroft and J. D. Ullman, Formal Languages and their relation to Automata, Addison Wesley, 1969.Google Scholar
  8. 8.
    S. C. Kleene, Representation of Events in Nerve Nets and Finite Automata, in Automata Studies (C. E. Shannon and J. Mc Carty, Eds), Princeton University Press, 1956, 3–41.Google Scholar
  9. 9.
    M. Nivat, Transductions des languages de Chomsky, Ann. Inst. Fourier 18, 1968, 336–456.Google Scholar
  10. 10.
    J. Sakarovitch, Théorie des Automates, en préparation.Google Scholar
  11. 11.
    M. P. Schützenberger, Certain elementary families of automata, in Proceedings of Symposium on Mathematical Theory of Automata, Polytechnic Institute of Brooklyn, 1962, 139–153.Google Scholar
  12. 12.
    E. Shamir, A representation theorem for algebraic and context free power series in non commuting variables, Inform. and Control 11, 1967, 234–254.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Jacques Sakarovitch
    • 1
  1. 1.Laboratoire d'Informatique Théorique et ProgrammationC.N.R.S. et Université Paris VIParis Cedex 05France

Personalised recommendations