A NOTE ON LIMITED PUSHDOWN ALPHABETS IN STATELESS DETERMINISTIC PUSHDOWN AUTOMATA

DOI10.1142/S0129054113500068zbMath1321.68340arXiv1208.5002OpenAlexW2058194693MaRDI QIDQ2856007

Tomáš Masopust

Publication date: 23 October 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.5002

zbMATH Keywords

deterministic pushdown automatainfinite hierarchyrealtime pushdown automatastateless pushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Descriptive complexity and finite models (68Q19)

Cites Work

• On stateless deterministic restarting automata
• DPDA's in 'Atomic normal form' and applications to equivalence problems
• The inclusion problem for simple languages
• Undecidable equivalences for basic process algebra
• \(L(A)=L(B)\)? decidability results from complete formal systems
• ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA

This page was built for publication: A NOTE ON LIMITED PUSHDOWN ALPHABETS IN STATELESS DETERMINISTIC PUSHDOWN AUTOMATA