A characterization of regular expressions under bisimulation
From MaRDI portal
Publication:3546331
DOI10.1145/1219092.1219094zbMath1292.68102OpenAlexW2117716713MaRDI QIDQ3546331
Clemens Grabmayer, Jos C. M. Baeten, Flavio Corradini
Publication date: 21 December 2008
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1219092.1219094
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Unnamed Item, Revisiting sequential composition in process calculi, Better automata through process algebra, Unnamed Item, Unnamed Item, Contract-based discovery of Web services modulo simple orchestrators