Language recognition by two-way deterministic pushdown automata
From MaRDI portal
Publication:2571535
DOI10.1007/s10559-005-0034-7zbMath1101.68661MaRDI QIDQ2571535
Publication date: 11 November 2005
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-005-0034-7
68Q45: Formal languages and automata
Cites Work
- Unnamed Item
- Deterministic two-way one-head pushdown automata are very powerful
- A hardest language recognized by two-way nondeterministic pushdown automata
- Fooling a two way automaton or one pushdown store is better than one counter for two way machines
- A characterization of semilinear sets
- Solvable problems for transformers with reversal-bounded counters
- Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages