A characterization of regular expressions under bisimulation

From MaRDI portal

Revision as of 01:00, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3546331

Jump to:navigation, search

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

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

This page was built for publication: A characterization of regular expressions under bisimulation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3546331&oldid=16926183"