A result on the equivalence problem for deterministic pushdown automata
From MaRDI portal
Publication:1230509
DOI10.1016/S0022-0000(76)80049-9zbMath0337.68032OpenAlexW2030400253MaRDI QIDQ1230509
Tadao Kasami, Kenichi Taniguchi
Publication date: 1976
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(76)80049-9
Related Items (16)
Superdeterministic DPDAs: The method of accepting does affect decision problems ⋮ The simultaneous accessibility of two configurations of two equivalent DPDA's ⋮ The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine ⋮ On the decidability of equivalence for deterministic pushdown transducers ⋮ DPDA's in 'Atomic normal form' and applications to equivalence problems ⋮ On jump-deterministic pushdown automata ⋮ On equivalence and subclass containment problems for deterministic context-free languages ⋮ A note on non-singular deterministic pushdown automata ⋮ Two decidability results for deterministic pushdown automata ⋮ On equivalence of grammars through transformation trees ⋮ Decidability of the equivalence problem for deterministic pushdown automata ⋮ Synchronizable deterministic pushdown automata and the decidability of their equivalence ⋮ A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars ⋮ New families of non real time dpda's and their decidability results ⋮ 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
Cites Work
This page was built for publication: A result on the equivalence problem for deterministic pushdown automata
