The equivalence problem for real-time strict deterministic languages
From MaRDI portal
Publication:3888532
DOI10.1016/S0019-9958(80)90887-6zbMath0444.68038MaRDI QIDQ3888532
Yasuyoshi Inagaki, Namio Honda, Michio Oyamaguchi
Publication date: 1980
Published in: Information and Control (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Decidability of DPDA equivalence, On some decision questions concerning pushdown machines, An extended direct branching algorithm for checking equivalence of deterministic pushdown automata, New techniques for proving the decidability of equivalence problem, Constructing a realtime deterministic pushdown automaton from a grammar, Fundamental properties of infinite trees, Some negative results concerning DPDA's, Some results on subclass containment problems for special classes of dpda's related to nonsingular machines, The equivalence and inclusion problems for NTS languages, NTS languages are deterministic and congruential, A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict, 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, A new class of C.F.L. for which the equivalence is decidable, The equivalence problem for LL- and LR-regular grammars, A hierarchy of real-time deterministic languages and their equivalence, Decidability of bisimulation equivalence for normed pushdown processes, \(L(A)=L(B)\)? decidability results from complete formal systems, Synchronizable deterministic pushdown automata and the decidability of their equivalence, A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars, An approach to deciding the observational equivalence of Algol-like languages, The equivalence problem for real-time deterministic pushdown automata, An axiomatic approach to the Korenjak-Hopcroft algorithms, Unnamed Item, The equivalence problem for real-time strict deterministic pushdown automata
