Cylindres de langages simples et pseudo-simples

  • J. -M. Autebert
Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 48)


There is a simple language S such that every realtime context-free language can be obtained by an inverse g.s.m. mapping from S. Hence the family of realtime context-free languages is a principal A.F.D.L.

We show here that the cylinder (closure under inverse homomorphism and intersection with regular sets) of realtime languages is principal and then we get easily the result.

Key words

Deterministic context-free realtime and simple deterministic languages cylinder principality 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J.M. AUTEBERT Non-principalité du cylindre des langages à compteur. à paraître dans Mathematical Systems TheoryGoogle Scholar
  2. [2]
    L. BOASSON et M. NIVAT Le cylindre des languages linéaires n'est pas principal 2.G.I. Fachtagung Automaten Theorie und Formale Sprachen (1975) p 16–19Google Scholar
  3. [3]
    S. GREIBACH The hardest Context-Free language S.I.A.M. Journal 2 (1973) p 304–310Google Scholar
  4. [4]
    S. GREIBACH Jump PDA's and hierarchies of deterministic Context-Free languages. S.I.A.M. Journal 3 (1974) p 111–127Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • J. -M. Autebert

There are no affiliations available

Personalised recommendations