Erasable context-free languages

DOI10.1016/S0019-9958(75)80002-7MaRDI QIDQ4079078zbMATH OpenFDO

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

Cited in

(16)

• On the intersection of the class of linear context-free languages and the class of single-reset languages
• Regulated nondeterminism in pushdown automata
• Remarks on the complexity of nondeterministic counter languages
• A representation theorem of infinite dimensional algebras and applications to language theory
• FORGETTING AUTOMATA AND UNARY LANGUAGES
• scientific article; zbMATH DE number 3770980 (Why is no real title available?)
• Simulations by time-bounded counter machines
• Uniformly erasable AFL
• Langages satures et cônes decroissants. Langages et cônes bifideles
• One-way simple multihead finite automata
• scientific article; zbMATH DE number 3560777 (Why is no real title available?)
• Single-tape reset machines
• Some uniformly erasable families of languages
• A note on real-time one-way alternating multicounter machines
• scientific article; zbMATH DE number 3688749 (Why is no real title available?)
• One counter languages and the IRS condition

This page was built for publication: Erasable context-free languages

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