Simplification Problems for Deterministic Pushdown Automata on Infinite Words

DOI10.1142/S0129054115400122zbMath1405.68169arXiv1405.5596OpenAlexW2284766497MaRDI QIDQ2800412

Christof Löding

Publication date: 15 April 2016

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

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

zbMATH Keywords

automata theory\(\omega\)-automatapushdown automataparity index

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• A decidability result for deterministic \(\omega\)-context-free languages
• \(L(A)=L(B)\)? decidability results from complete formal systems
• Pushdown processes: Games and model-checking
• Regularity and Related Problems for Deterministic Pushdown Automata
• A regularity test for pushdown machines