Some uniformly erasable families of languages

DOI10.1016/0304-3975(76)90004-9zbMath0343.68033OpenAlexW2086650792MaRDI QIDQ1232299

Jonathan Goldstine, Seymour Ginsburg, Sheila A. Greibach

Publication date: 1976

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(76)90004-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Unnamed Item, Cônes rationnels commutatifs, Unnamed Item, Langages satures et cônes decroissants. Langages et cônes bifideles, Abstract Families of Abstract Categorial Languages, Non-prinicipalité du cylindre des langages à compteur, Langages algébriques, paires iterantes et transductions rationnelles, Langages à un compteur, An algebraic characterization of some principal regulated rational cones, Infinite linear systems and one counter languages, Bicentres de langages algébriques

Cites Work

• Unnamed Item
• Unnamed Item
• Uniformly erasable AFL
• Principal AFL
• Three theorems concerning principal AFLs
• Erasable context-free languages
• A Characterization of Machine Mappings
• Finite-Turn Pushdown Automata
• An Infinite Hierarchy of Context-Free Languages