scientific article; zbMATH DE number 2086608

MaRDI QIDQ4737142zbMATH OpenFDO

Authors Géraud Sénizergues

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23800037.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Decidability of the equivalence problem for deterministic pushdown automata
• \(L(A)=L(B)\)? decidability results from complete formal systems
• Decidability of DPDA language equivalence via first-order grammars
• Equivalence of deterministic pushdown automata revisited
• scientific article; zbMATH DE number 1232245

Cited in

(5)

• Equivalence of pushdown automata via first-order grammars
• scientific article; zbMATH DE number 5839804 (Why is no real title available?)
• System \(F^\mu_\omega\) with context-free session types
• A kind of simplified formal deductive system \(L_0^*\) for the system \(L^*\)
• \(L(A)=L(B)\)? decidability results from complete formal systems

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 Q4737142)