Comparing language operations
From MaRDI portal
Publication:4146261
DOI10.1007/BF01683281zbMath0369.68042MaRDI QIDQ4146261
Publication date: 1977
Published in: Mathematical Systems Theory (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Syntactic operators on full semiAFLs
- Reversal-bounded multipushdown machines
- Checking automata and one-way stack languages
- Substitution and bounded languages
- Note on the boolean properties of context free languages
- Mappings of languages by two-tape devices
- On Relations Defined by Generalized Finite Automata
- Deterministic context free languages
- Finite-Turn Pushdown Automata
- The Unsolvability of the Recognition of Linear Context-Free Languages
- An Infinite Hierarchy of Context-Free Languages
- Studies in abstract families of languages
- Chains of full AFL's
- Characteristic and ultrarealtime languages