On the Density of Context-Free and Counter Languages
From MaRDI portal
Publication:4640039
DOI10.1142/S0129054118400051zbMath1387.68155MaRDI QIDQ4640039
Ian McQuillan, Joey Eremondi, Oscar H. Ibarra
Publication date: 15 May 2018
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items
On the decidability of infix inclusion problem ⋮ Unboundedness problems for machines with reversal-bounded counters ⋮ On store languages of language acceptors ⋮ On families of full trios containing counter machine languages
Cites Work
- On the containment and equivalence problems for two-way transducers
- One-reversal counter machines and multihead automata: revisited
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Reversal-bounded multipushdown machines
- A useful device for showing the solvability of some decision problems
- \(L(A)=L(B)\)? decidability results from complete formal systems
- Deletion operations on deterministic families of automata
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Morphisms preserving densities
- CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES
- Deterministic context free languages
- A variant of a recursively unsolvable problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
