Some properties of language families generated by commutative languages

  • Juha Kortelainen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 117)


Regular Language State Acceptor Empty Word Language Family Enumerable 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S.Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland Publishing Company, 1975.Google Scholar
  2. 2.
    S. Ginsburg and J. Goldstine, Intersection-Closed Full AFL and the Recursively Enumerable Languages,Inf. Control 22 (1973), 201–231.Google Scholar
  3. 3.
    J. Goldstine, Substitution and Bounded Languages, J.Comput.Syst.Sci. 6, (1972), 9–29.Google Scholar
  4. 4.
    J. Goldstine, Bounded AFLs, J.Comput.Syst.Sci. 12 (1976), 399–419.Google Scholar
  5. 5.
    M. Latteux, Cônes rationnels commutativement clos, RAIRO, Inf.Theor. 11 (1977), 29–51.Google Scholar
  6. 6.
    M. Latteux, Langages commutatifs, Thesè Sciences Mathematiques, Universitè Lille, 1978.Google Scholar
  7. 7.
    M. Latteux, Cônes rationnels commutatifs, J.Comput.Syst.Sci. 18 (1979), 307–333.Google Scholar
  8. 8.
    B. Rovan, Proving Containment of Bounded Languages, J.Comput.Syst.Sci. 11 (1975), 1–55.Google Scholar
  9. 9.
    P.Turakainen, On Some Bounded SemiAFLs and AFLs (to appear in Inf. Sci.).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Juha Kortelainen
    • 1
  1. 1.Department of Mathematics Faculty of ScienceUniversity of Oulu LinnanmaaOulu 57Finland

Personalised recommendations