A new characterization of the regular languages

  • Christophe Reutenauer
Session 5: E. Shamir, Chairman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 115)


We define weakly commutative languages and periodic languages. We show that a language is regular if and only if it is simultaneously weakly commutative and periodic.


  1. (1).
    S.Eilenberg: Automata, languages and machines vol.A Acad. Press (1974)Google Scholar
  2. (2).
    G.Lallement: Semigroups and combinatorial applications John Wiley (1979)Google Scholar
  3. (3).
    C. Reutenauer: Séries formelles et algèbres syntactiques J.Algebra 66 (1980) 448–483.Google Scholar
  4. (4).
    L.H.Rowen: Polynomial identities in ring theory Acad. Press (1980)Google Scholar
  5. (5).
    A.Salomaa and M.Soittola: Automata-theoretic aspects of formal power series Springer (1978)Google Scholar
  6. (6).
    A.I. Shirshov: On rings with identity relations Mat. Sb. N. S. 43 (85) (1957) 277–283 (russian)Google Scholar
  7. (7).
    E.D. Sontag: On some questions of rationality and decidability J.Comput.System Sci. 11 (1975) 375–385Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Christophe Reutenauer
    • 1
  1. 1.LITP Institut de ProgrammationParisFrance

Personalised recommendations