Erasing in context-free AFLs
From MaRDI portal
Publication:5661158
DOI10.1016/S0019-9958(72)90133-7zbMath0248.68036MaRDI QIDQ5661158
Publication date: 1972
Published in: Information and Control (Search for Journal in Brave)
Related Items
Single-tape reset machines ⋮ Representations of language families by homomorphic equality operations and generalized equality sets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reset machines ⋮ Langages satures et cônes decroissants. Langages et cônes bifideles ⋮ One counter languages and the IRS condition ⋮ Uniformly erasable AFL ⋮ Classes of formal grammars
