scientific article; zbMATH DE number 1232245

zbMATH Open0907.68128MaRDI QIDQ4223071FDOQ4223071

Authors: Géraud Sénizergues 

Publication date: 3 January 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

deterministic pushdown automatacomplete formal system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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
• Title not available (Why is that?)
• \(L(A)=L(B)\)? decidability results from complete formal systems
• Title not available (Why is that?)
• Trace inclusion for one-counter nets revisited
• Equivalence of deterministic pushdown automata revisited
• Title not available (Why is that?)
• 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)