The equivalence problem for real-time deterministic pushdown automata

DOI10.1007/BF01074776zbMATH Open0625.68035OpenAlexW1969807610MaRDI QIDQ3028347FDOQ3028347

Authors:

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)

Cites Work

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

Cited In (2)

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

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

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