A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata
From MaRDI portal
Publication:3327736
DOI10.1016/S0019-9958(82)80029-6zbMath0541.68053MaRDI QIDQ3327736
Publication date: 1982
Published in: Information and Control (Search for Journal in Brave)
Related Items
The extended equivalence problem for a class of non-real-time deterministic pushdown automata, A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict, A hierarchy of real-time deterministic languages and their equivalence, Synchronizable deterministic pushdown automata and the decidability of their equivalence, A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars, Some results on subclass containment problems for special classes of dpda's related to nonsingular machines, An extended direct branching algorithm for checking equivalence of deterministic pushdown automata
