Decidability of the equivalence problem for deterministic pushdown automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- A result on the equivalence problem for deterministic pushdown automata
- Deterministic context free languages
- Deterministic one-counter automata
- Equivalence problems for deterministic context-free languages and monadic recursion schemes
- On the translation of languages from left to right
- Program schemes, recursion schemes, and formal languages
- Properties of deterministic top-down grammars
- The equivalence problem for deterministic finite-turn pushdown automata
Cited in
(33)- Decidability of behavioural equivalence in unary PCF
- Decidability of the reachability problem for pushdown relational automata
- Decidability of the equivalence problem for synchronous deterministic pushdown-store automata
- scientific article; zbMATH DE number 2086674 (Why is no real title available?)
- scientific article; zbMATH DE number 2150277 (Why is no real title available?)
- A weaker sufficient condition for the equivalence of a pair of DPDA's to be decidable
- Simple reductions between \(D0L\) language and sequence equivalence problems
- Equivalence of pushdown automata via first-order grammars
- Decision problems for pushdown threads
- Equivalence of deterministic pushdown automata revisited
- scientific article; zbMATH DE number 2038732 (Why is no real title available?)
- Decidable subcases of the equivalence problem for recursive program schemes
- Language equivalence of probabilistic pushdown automata
- The extended equivalence problem for a class of non-real-time deterministic pushdown automata
- An axiomatic approach to the Korenjak-Hopcroft algorithms
- Decidability of equivalence of symbolic derivations
- On Büchi one-counter automata
- A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata
- The equivalence problem for deterministic pushdown automata is decidable
- On the determinacy problem for two-way pushdown automata
- scientific article; zbMATH DE number 1738658 (Why is no real title available?)
- scientific article; zbMATH DE number 1738657 (Why is no real title available?)
- scientific article; zbMATH DE number 2086608 (Why is no real title available?)
- scientific article; zbMATH DE number 1929958 (Why is no real title available?)
- An intermediate machine technique for deciding equivalence between a DPDA and a linear DPDA
- Equivalences of Pushdown Systems Are Hard
- scientific article; zbMATH DE number 4083010 (Why is no real title available?)
- \(L(A)=L(B)\)? decidability results from complete formal systems
- DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA
- A criterion for the decidability of the \(A\)-completeness problem for definite automata
- On the decidability of the PVD class with equality
- The equivalence problem for real-time DPDAs
- Decidability of DPDA equivalence
This page was built for publication: Decidability of the equivalence problem for deterministic pushdown automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1816326)
