An unsolvable algorithmic problem of deterministic push-down automatons

MaRDI QIDQ1360771zbMATH OpenFDO

Authors L. I. Stanevichene

Publication date 2 March 1998

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

deterministic push-down automatons

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• One unresolvable algorithmic problem
• Decidability of the equivalence problem for deterministic pushdown automata
• The equivalence problem for deterministic pushdown automata is decidable
• Equivalence of deterministic pushdown automata revisited

Cited in

(2)

• One unresolvable algorithmic problem
• An unsolvable algorithmic problem for deterministic real-time pushdown automata

This page was built for publication: An unsolvable algorithmic problem of deterministic push-down automatons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1360771)