A Comparison of Succinctly Represented Finite-State Systems

DOI10.1007/978-3-642-32940-1_12zbMath1364.68277OpenAlexW139925549MaRDI QIDQ2914368

Ocan Sankur, Romain Brenguier, Stefan Göller

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32940-1_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Compressed Tree Canonization ⋮ Repairing real-time requirements

This page was built for publication: A Comparison of Succinctly Represented Finite-State Systems