Abstract
Stream automata (also called ω-automata) and ω-regular languages are of paramount importance in Computer Science and Logic. A coalgebraic treatment of these structures has not been given yet. We study a simple two-sorted setting where deterministic Muller automata can be cast as coalgebras, so that coalgebraic bisimilarity coincides with language equivalence. From this characterisation, we derive concise and natural decision procedures for complementation, union, intersection, and equivalence check. © 2012 IFIP International Federation for Information Processing.
Cite
CITATION STYLE
Ciancia, V., & Venema, Y. (2012). Coalgebraic Methods in Computer Science. (D. Pattinson & L. Schröder, Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7399, pp. 90–108). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-32784-1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
