Erasable context-free languages

DOI10.1016/S0019-9958(75)80002-7zbMath0317.68059MaRDI QIDQ4079078

Sheila A. Greibach

Publication date: 1975

Published in: Information and Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Single-tape reset machines ⋮ Regulated nondeterminism in pushdown automata ⋮ On the intersection of the class of linear context-free languages and the class of single-reset languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ FORGETTING AUTOMATA AND UNARY LANGUAGES ⋮ Langages satures et cônes decroissants. Langages et cônes bifideles ⋮ Unnamed Item ⋮ One counter languages and the IRS condition ⋮ Uniformly erasable AFL ⋮ Remarks on the complexity of nondeterministic counter languages ⋮ Some uniformly erasable families of languages ⋮ A representation theorem of infinite dimensional algebras and applications to language theory ⋮ One-way simple multihead finite automata ⋮ SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES ⋮ A note on real-time one-way alternating multicounter machines