An introduction to decidability of DPDA equivalence
From MaRDI portal
(Redirected from An introduction to decidability of DPDA equivalence)
Recommendations
Cited in
(18)- Some negative results concerning DPDA's
- A weaker sufficient condition for the equivalence of a pair of DPDA's to be decidable
- On the decidability of the PVD class with equality
- Schema revisited
- Simplification problems for deterministic pushdown automata on infinite words
- Decidability of DPDA language equivalence via first-order grammars
- An intermediate machine technique for deciding equivalence between a DPDA and a linear DPDA
- Deterministic Algorithms, Simple Languages And One‐to‐One Gentzen Type Formalizations
- Decidable subcases of the equivalence problem for recursive program schemes
- scientific article; zbMATH DE number 4083010 (Why is no real title available?)
- Some applications of the decidability of DPDA's equivalence
- The equivalence problem for deterministic pushdown automata is decidable
- Deciding DPDA equivalence is primitive recursive
- The Hoare logic of deterministic and nondeterministic monadic recursion schemes
- A fast algorithm to decide on the equivalence of stateless DPDA
- Idealized Algol with ground recursion, and DPDA equivalence
- Decidability of DPDA equivalence
- New families of non real time dpda's and their decidability results
This page was built for publication: An introduction to decidability of DPDA equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474205)