A Process-Theoretic Look at Automata
From MaRDI portal
Publication:3400912
DOI10.1007/978-3-642-11623-0_1zbMath1274.68155OpenAlexW2167018151MaRDI QIDQ3400912
Bas Luttik, P. J. A. van Tilburg, Pieter J. L. Cuijpers, Jos C. M. Baeten
Publication date: 28 January 2010
Published in: Fundamentals of Software Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11623-0_1
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics, On the Executability of Interactive Computation, Unnamed Item, Reactive Turing machines, Unnamed Item, Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity, Reactive Turing Machines