Pushdown-automata and families of languages generating cylinders

  • Jean-Michel Autebert
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)


Input Alphabet Input Tape Free Language Linear Language Specific Automaton 
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.
    Autebert, J.-M., Non-principalité du cylindre des langages a computeur. To appear in Mathematical Systems Theory.Google Scholar
  2. 2.
    Autebert, J.-M., Cylindres de langages simples et pseudo-simples. In: Lecture Notes in Computer Science, 48 Springer-Verlag. (1977) 149–153.Google Scholar
  3. 3.
    Boasson, L. and Nivat, M., Le cylindre des langages linéaires. To appear in M.S.T. Google Scholar
  4. 4.
    Ginsburg, S., Golstine J., and Greibach, S., Some uniformely erasable families of languages. Theoretical Computer Science, 2, (1976) 29–44.CrossRefGoogle Scholar
  5. 5.
    Greibach, S., The hardest C. F. language. SIAM Journal, 2 (1973) 304–310.CrossRefGoogle Scholar
  6. 6.
    Greibach, S., Jump PDA's and hierarchies of deterministic C. F. languages. SIAM Journal, 3 (1974) 111–127.CrossRefGoogle Scholar
  7. 7.
    Shamir, E., A representation theorem for algebraic and C. F. power series in non-commutating variables. Information and Control, 11 (1967) 239–254.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Jean-Michel Autebert
    • 1
  1. 1.Laboratoire associé du C.N.R.S.Informatique Théorique et Programmation Institut de ProgrammationPARIS CEDEX 05

Personalised recommendations