The equivalence problem for real-time deterministic pushdown automata

DOI10.1007/BF01074776zbMath0625.68035OpenAlexW1969807610MaRDI QIDQ3028347

Unnamed Author

Publication date: 1986

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01074776

zbMATH Keywords

decidability of the algorithmic equivalence problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Related Items (2)

Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines ⋮ \(L(A)=L(B)\)? decidability results from complete formal systems

Cites Work

• The equivalence problem for real-time strict deterministic languages
• The equivalence problem for deterministic finite-turn pushdown automata
• Nested Stack Automata

This page was built for publication: The equivalence problem for real-time deterministic pushdown automata