Uniformly erasable AFL

DOI10.1016/S0022-0000(75)80038-9MaRDI QIDQ1225462zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A characterization of parenthesis languages
• A helpful result for proving inherent ambiguity
• AFL with the semilinear property
• An Infinite Hierarchy of Context-Free Languages
• Bracketed context-free languages
• Chains of full AFL's
• Checking automata and one-way stack languages
• Control sets on grammars
• Derivation-bounded languages
• Erasable context-free languages
• Erasing in context-free AFLs
• Finite-Turn Pushdown Automata
• scientific article; zbMATH DE number 3483582 (Why is no real title available?)
• Inclusion relations among families of context-free languages
• Multitape AFA
• Principal AFL
• Transductions des langages de Chomsky

Cited in

(10)

• 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
• Langages à un compteur
• On the usefulness of bifaithful rational cones
• scientific article; zbMATH DE number 3677223 (Why is no real title available?)
• Compelled operations and operations of degreeP
• Sur les générateurs algébriques et linéaires
• Remarques sur les langages de parenthèses

This page was built for publication: Uniformly erasable AFL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1225462)