The extended equivalence problem for a class of non-real-time deterministic pushdown automata
From MaRDI portal
Publication:1894681
DOI10.1007/BF01178385zbMath0827.68076MaRDI QIDQ1894681
Publication date: 13 December 1995
Published in: Acta Informatica (Search for Journal in Brave)
Related Items (2)
The extended equivalence problem for a class of non-real-time deterministic pushdown automata ⋮ On the Decidability of the Equivalence Problem for Monadic Recursive Programs
Cites Work
- Unnamed Item
- Unnamed Item
- New families of non real time dpda's and their decidability results
- Some remarks on subclass containment problems for several classes of dpda's
- An extended direct branching algorithm for checking equivalence of deterministic pushdown automata
- A weaker sufficient condition for the equivalence of a pair of DPDA's to be decidable
- A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict
- The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine
- A hierarchy of real-time deterministic languages and their equivalence
- On equivalence of grammars through transformation trees
- Synchronizable deterministic pushdown automata and the decidability of their equivalence
- A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars
- The extended equivalence problem for a class of non-real-time deterministic pushdown automata
- A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata
- An axiomatic approach to the Korenjak-Hopcroft algorithms
- The equivalence problem for real-time DPDAs
- The equivalence problem for some non-real-time deterministic pushdown automata
This page was built for publication: The extended equivalence problem for a class of non-real-time deterministic pushdown automata
