A weaker sufficient condition for the equivalence of a pair of DPDA's to be decidable

DOI10.1016/0304-3975(85)90072-6zbMath0591.68079OpenAlexW2014664481MaRDI QIDQ1075060

Etsuji Tomita, Kazushi Seino

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90072-6

zbMATH Keywords

non-real-time deterministic pushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

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

Cites Work

• An extended direct branching algorithm for checking equivalence of deterministic pushdown automata

This page was built for publication: A weaker sufficient condition for the equivalence of a pair of DPDA's to be decidable