scientific article; zbMATH DE number 1232245

MaRDI QIDQ4223071zbMATH OpenFDO

Authors Géraud Sénizergues

Publication date 3 January 1999

zbMATH Keywords

deterministic pushdown automatacomplete formal system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• \(L(A)=L(B)\)? decidability results from complete formal systems
• The equivalence problem for deterministic pushdown automata is decidable
• Decidability of the equivalence problem for deterministic pushdown automata

Cited in

(10)

• Decidability of equivalence of symbolic derivations
• Decidability of the equivalence problem for deterministic pushdown automata
• The equivalence problem for deterministic pushdown automata is decidable
• scientific article; zbMATH DE number 4058890 (Why is no real title available?)
• \(L(A)=L(B)\)? decidability results from complete formal systems
• scientific article; zbMATH DE number 7075861 (Why is no real title available?)
• Trace inclusion for one-counter nets revisited
• Equivalence of deterministic pushdown automata revisited
• scientific article; zbMATH DE number 2086608 (Why is no real title available?)
• The equivalence of deterministic gsm replications onQ-rational languages is decidable

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