scientific article
From MaRDI portal
Publication:3219135
zbMATH Open0555.68048MaRDI QIDQ3219135
Publication date: 1984
Title of this publication is not available (Why is that?)
Related Items (8)
The extended equivalence problem for a class of non-real-time deterministic pushdown automata ⋮ The finiteness of synchronous, tabled picture languages is decidable ⋮ Title not available (Why is that?) ⋮ On the decidability of the PVD class with equality ⋮ Equivalences of Pushdown Systems Are Hard ⋮ A direct branching algorithm for checking equivalence of some classes of deterministic pushdown automata ⋮ Decidability of DPDA equivalence ⋮ Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3219135)
