scientific article
From MaRDI portal
Publication:2908855
DOI10.4230/LIPIcs.FSTTCS.2010.260zbMath1245.68134MaRDI QIDQ2908855
Wojciech Czerwiński, Sławomir Lasota
Publication date: 29 August 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_755d.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (5)
Bisimulation equivalence and regularity for real-time one-counter automata ⋮ Equivalence of pushdown automata via first-order grammars ⋮ Deciding the Bisimilarity of Context-Free Session Types ⋮ Language equivalence of probabilistic pushdown automata ⋮ The complexity of compressed membership problems for finite automata
This page was built for publication:
