Erasable context-free languages
From MaRDI portal
Publication:4079078
DOI10.1016/S0019-9958(75)80002-7zbMATH Open0317.68059MaRDI QIDQ4079078FDOQ4079078
Authors: Sheila A. Greibach 
Publication date: 1975
Published in: Information and Control (Search for Journal in Brave)
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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Single-tape reset machines
- Some uniformly erasable families of languages
- Title not available (Why is that?)
- A note on real-time one-way alternating multicounter machines
- 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)
