scientific article; zbMATH DE number 1738657

MaRDI QIDQ4529994zbMATH OpenFDO

Authors Géraud Sénizergues

Publication date 7 May 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2055/20550114

Mathematics Subject Classification ID

Theory of programming languages (68N15) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Decidability of the equivalence problem for deterministic pushdown automata
• scientific article; zbMATH DE number 2081092
• The equivalence problem for deterministic pushdown automata is decidable
• Decidability of DPDA equivalence
• scientific article; zbMATH DE number 2086674

Cited in

(14)

• Deterministic finite automata with recursive calls and DPDAs
• Some negative results concerning DPDA's
• Decidability of the equivalence problem for synchronous deterministic pushdown-store automata
• A weaker sufficient condition for the equivalence of a pair of DPDA's to be decidable
• Decidability of the equivalence problem for deterministic pushdown automata
• On the decidability of the PVD class with equality
• Simplification problems for deterministic pushdown automata on infinite words
• Decidable subcases of the equivalence problem for recursive program schemes
• scientific article; zbMATH DE number 4083010 (Why is no real title available?)
• Decision problems for deterministic pushdown automata on infinite words
• A fast algorithm to decide on the equivalence of stateless DPDA
• Decidability of DPDA equivalence
• Some remarks on subclass containment problems for several classes of dpda's
• Decision problems for pushdown threads

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