Uniformly erasable AFL

DOI10.1016/S0022-0000(75)80038-9zbMath0325.68042OpenAlexW2085672293MaRDI QIDQ1225462

Seymour Ginsburg, Jonathan Goldstine, Sheila A. Greibach

Publication date: 1975

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(75)80038-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On the usefulness of bifaithful rational cones, Sur les générateurs algébriques et linéaires, Unnamed Item, Langages satures et cônes decroissants. Langages et cônes bifideles, Some uniformly erasable families of languages, One way finite visit automata, Générateurs algébriques et systèmes de paires iterantes, Compelled operations and operations of degreeP, Langages à un compteur, Remarques sur les langages de parenthèses

Cites Work

• Unnamed Item
• Transductions des langages de Chomsky
• Bracketed context-free languages
• Checking automata and one-way stack languages
• Derivation-bounded languages
• Principal AFL
• AFL with the semilinear property
• Erasable context-free languages
• Finite-Turn Pushdown Automata
• Control sets on grammars
• A helpful result for proving inherent ambiguity
• An Infinite Hierarchy of Context-Free Languages
• A characterization of parenthesis languages
• Chains of full AFL's
• Inclusion relations among families of context-free languages
• Multitape AFA
• Erasing in context-free AFLs