scientific article; zbMATH DE number 2086674

zbMATH Open1057.68052MaRDI QIDQ4737211FDOQ4737211

Authors: Colin Stirling 

Publication date: 11 August 2004

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

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

Recommendations

• scientific article; zbMATH DE number 2081092
• Decidability of the equivalence problem for deterministic pushdown automata
• Decidability of DPDA language equivalence via first-order grammars
• The equivalence problem for deterministic pushdown automata is decidable
• Decidability of the equivalence problem for synchronous deterministic pushdown-store automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25)

Cited In (27)

• Equivalence of pushdown automata via first-order grammars
• Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence
• From security protocols to pushdown automata
• On the computational complexity of bisimulation, redux
• On the universe, disjointness, and containment problems for simple machines
• An approach to deciding the observational equivalence of Algol-like languages
• The equivalence problem for real-time DPDAs
• A fast algorithm to decide on the equivalence of stateless DPDA
• Decidability of DPDA equivalence
• Trace inclusion for one-counter nets revisited
• On long words avoiding Zimin patterns
• Bisimulation equivalence and regularity for real-time one-counter automata
• Deterministic finite automata with recursive calls and DPDAs
• Selected Ideas Used for Decidability and Undecidability of Bisimilarity
• Title not available (Why is that?)
• The Hoare logic of deterministic and nondeterministic monadic recursion schemes
• An intermediate machine technique for deciding equivalence between a DPDA and a linear DPDA
• On decision problems for parameterized machines
• Trace inclusion for one-counter nets revisited
• Title not available (Why is that?)
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decidable subcases of the equivalence problem for recursive program schemes
• System \(F^\mu_\omega\) with context-free session types
• Model-checking games for typed \(\lambda\)-calculi
• A weaker sufficient condition for the equivalence of a pair of DPDA's to be 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 Q4737211)