Advertisement

More about the "geography" of context-free languages

  • J. Beauquier
  • J. Berstel
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)

Keywords

Formal Language Theory Free Language Counter Language Linear Language Pushdown Store 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. Beauquier, Générateurs algébriques et systèmes de paires itérantes, Theoretical Computer Science, 8 (1979), p. 293–323.Google Scholar
  2. [2]
    J. Berstel, "Transduction and context-free languages", Teubner Verlag 1979.Google Scholar
  3. [3]
    L. Boasson, Two iteration theorems for some families of languages, JCSS 7 (1973), p. 583–596.Google Scholar
  4. [4]
    R. Book, M. Nivat, M. Paterson, Reversal bounded acceptors and the intersection of linear languages, SIAM Journal on Computing 3(1974), p. 283–297.Google Scholar
  5. [5]
    S. Ginsburg, "Algebraic and automata-theoretic properties of formal languages", North Holland, 1975.Google Scholar
  6. [6]
    S. Ginsburg, E. Spanier, Derivation bounded languages, JCSS 2(1968), p. 228–250.Google Scholar
  7. [7]
    S. Greibach, An infinite hierarchy of context-free languages, J. of the ACM 16(1969), p. 91–101.Google Scholar
  8. [8]
    S. Greibach, Chains of full AFL's, Math. Systems Th. 4(1970), p. 231–242.Google Scholar
  9. [9]
    S. Greibach, One counter languages and the IRS condition, JCSS 10(1975), p. 237–247.Google Scholar
  10. [10]
    S. Greibach, One counter languages and the chevron operation, RAIRO Informatique théorique 13(1979), p. 189–194.Google Scholar
  11. [11]
    L. Haines, On free monoids partially ordered by embedding, J. Comb. Th. 6(1969), p. 94–98.Google Scholar
  12. [12]
    G. Higman, Ordering by divisibility in abstract algebras, Proc. London Math. Soc. 2(1952), p. 326–336.Google Scholar
  13. [13]
    M. Harrison, "Introduction to formal language theory", Addison Wesley 1978.Google Scholar
  14. [14]
    M. Paterson, L. Valiant, Deterministic one counter automata, JCSS 10 (1975), p. 340–350.Google Scholar
  15. [15]
    M. Yntema, Inclusion relations among families of context-free languages, Information and Control, 10 (1967), p. 572–597.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • J. Beauquier
    • 1
    • 3
  • J. Berstel
    • 2
  1. 1.L.I.T.P. and Université de PicardieFrance
  2. 2.L.I.T.P. and Université Pierre et Marie CurieFrance
  3. 3.Université de Picardie — U.E.R. de MathématiquesAmiens CedexFrance

Personalised recommendations