论文信息 - A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's to be Decidable

A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's to be Decidable

Abstract This short paper further extends the result of Tomita (1984) to have a weaker sufficient condition for the equivalence of a pair of non-real-time deterministic pushdown automata to be decidable.

Etsuji Tomita | Kazushi Seino

[1] Etsuji Tomita. An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata , 1984, Theor. Comput. Sci..