Automata, Languages and Programming
From MaRDI portal
Publication:5716825
DOI10.1007/11523468zbMath1084.68082OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716825
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (3)
Ready to preorder: an algebraic and general proof ⋮ On finite alphabets and infinite bases ⋮ On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
This page was built for publication: Automata, Languages and Programming
