scientific article; zbMATH DE number 2086674

zbMath1057.68052MaRDI QIDQ4737211

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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (15)

From Security Protocols to Pushdown Automata ⋮ The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes ⋮ An approach to deciding the observational equivalence of Algol-like languages ⋮ Trace Inclusion for One-Counter Nets Revisited ⋮ Trace inclusion for one-counter nets revisited ⋮ Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines ⋮ Bisimulation equivalence and regularity for real-time one-counter automata ⋮ Equivalence of pushdown automata via first-order grammars ⋮ Selected Ideas Used for Decidability and Undecidability of Bisimilarity ⋮ On the computational complexity of bisimulation, redux ⋮ On decision problems for parameterized machines ⋮ On the universe, disjointness, and containment problems for simple machines ⋮ Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence ⋮ On long words avoiding Zimin patterns ⋮ Model-Checking Games for Typed λ-Calculi

This page was built for publication: