The equivalence problem for real-time DPDAs
From MaRDI portal
Recommendations
- The equivalence problem for deterministic pushdown automata is decidable
- Decidability of the equivalence problem for deterministic pushdown automata
- A weaker sufficient condition for the equivalence of a pair of DPDA's to be decidable
- scientific article; zbMATH DE number 2086674
- Decidability of the equivalence problem for synchronous deterministic pushdown-store automata
Cited in
(20)- Decidability of the equivalence problem for synchronous deterministic pushdown-store automata
- Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
- \(L(A)=L(B)\)? decidability results from complete formal systems
- \(L(A)=L(B)\)? A simplified decidability proof.
- The extended equivalence problem for a class of non-real-time deterministic pushdown automata
- Problems of inclusion and equivalence for program schemata and formal languages
- Equivalence of deterministic pushdown automata revisited
- An unsolvable algorithmic problem for deterministic real-time pushdown automata
- scientific article; zbMATH DE number 6708299 (Why is no real title available?)
- Language equivalence of deterministic real-time one-counter automata is NL-complete
- An intermediate machine technique for deciding equivalence between a DPDA and a linear DPDA
- Decidable subcases of the equivalence problem for recursive program schemes
- scientific article; zbMATH DE number 2038732 (Why is no real title available?)
- The equivalence problem for deterministic pushdown automata is decidable
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
- A fast algorithm to decide on the equivalence of stateless DPDA
- Bisimulation equivalence of pushdown automata is Ackermann-complete
- New families of non real time dpda's and their decidability results
- Some decision problems about controlled rewriting systems
- New techniques for proving the decidability of equivalence problem
This page was built for publication: The equivalence problem for real-time DPDAs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777488)
