Conditions enforcing regularity of context-free languages

  • A. Ehrenfeucht
  • D. Haussler
  • G. Rozenberg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)


Regular Language Formal Language Theory Parikh Vector Insertion System Finite Nonempty Subset 
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. [ABBL]
    J.M. Autebert, J. Beauquier, L. Boasson and M. Latteux, Very small families of algebraic nonrational languages, in R. Book (ed.), Formal language theory; perspectives and open problems, 1980, Academic Press, London, New York, 89–108.CrossRefGoogle Scholar
  2. [ABBN]
    J.M. Autebert, J. Beauquier, L. Boasson and M. Nivat, Quelques problèmes ouverts en théorie des languages algébriques, 1979, RAIRO Informatique Theorique, v. 13, 363–379.MathSciNetCrossRefGoogle Scholar
  3. [BEM]
    D.R. Bean, A. Ehrenfeucht and G.F. McNulty, Avoidable patterns in strings of symbols, 1979, Pacific Journal of Mathematics, v. 85, n.2, 261–293.MathSciNetCrossRefGoogle Scholar
  4. [Be]
    J. Berstel, Sur les mots sans carré definis par un morphisme, 1979, Springer Lecture Notes in Computer Science, v. 71, 16–25.CrossRefGoogle Scholar
  5. [B]
    L. Boasson, Un critére de rationnalité des languages algébriques, in M. Nivat (ed.), Automata, Languages and Programming, 1973, North-Holland, Amsterdam, 359–365.Google Scholar
  6. [B1]
    L. Boasson, private communication.Google Scholar
  7. [ER]
    A. Ehrenfeucht and G. Rozenberg, On the separating power of EOL systems, RAIRO Informatique Theorique, to appear.Google Scholar
  8. [H]
    M. Harrison, Introduction to formal language theory, 1978, Addison-Wesley, Reading, Massachusetts.zbMATHGoogle Scholar
  9. [Hi]
    G.H. Higman, Ordering by divisibility in abstract algebras, 1952, Proc. London Math. Society, v.3, 326–336.MathSciNetCrossRefGoogle Scholar
  10. [L1]
    M. Latteux, Ph.D. thesis, 1979, University of Lille.Google Scholar
  11. [L2]
    M. Latteux, CÔnes rationnels commutatifs, 1979, Journal of Computer and Systems Science, v. 18, 307–333.CrossRefGoogle Scholar
  12. [L3]
    M. Latteux, private communication.Google Scholar
  13. [NW]
    C.St.J.A. Nash-Williams, A survey of the theory of well-quasi-ordered sets, in Combinatorial Structures and Their Applications, 1970, Gordon and Breach, New York, London, 293–300.Google Scholar
  14. [RW]
    R. Ross and K. Winklman, Repetitive strings are not context-free, RAIRO Informatique Theorique, to appear.Google Scholar
  15. [S]
    A. Salomaa, Jewels of formal language theory, 1981, Computer Science Press, Rockville, Maryland.zbMATHGoogle Scholar
  16. [T]
    A. Thue, Uber unendliche Zeichenreihen, 1906, Norske Vid. Selsk.Skr., I Mat. Nat. Kl., Christiania, v. 7, 1–22.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • A. Ehrenfeucht
    • 1
  • D. Haussler
    • 1
  • G. Rozenberg
    • 2
  1. 1.Dept. of Computer ScienceUniversity of Colorado at BoulderBoulderUSA
  2. 2.Institute of Applied Mathematics and Computer ScienceUniversity of LeidenAL LeidenThe Netherlands

Personalised recommendations