scientific article; zbMATH DE number 2081092

zbMath1057.68051MaRDI QIDQ4474205

Colin Stirling

Publication date: 4 August 2004

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

decidabilitylanguage equivalenceprocess calculusbisimulation equivalencedeterministic pushdown automatondeterministic tableau proof decision procedure

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)

Related Items (1)

The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes

This page was built for publication: