Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Lecture Notes in Computer Science;J. Adámek,2012
2. Lecture Notes in Computer Science;N. Bezhanishvili,2012
3. Bonchi, F., Bonsangue, M.M., Hansen, H.H., Panangaden, P., Rutten, J.J.M.M., Silva, A.: Algebra-coalgebra duality in Brzozowski’s minimization algorithm. ACM Trans. Comput. Log. 15(1), 3 (2014)
4. Brzozowski, J.: Canonical regular expressions and minimal state graphs for definite events. Mathematical Theory of Automata 12, 529–561 (1962)
5. Cîrstea, C.: From branching to linear time, coalgebraically. In: Procs. FICS 2013. EPTCS, vol. 126, pp. 11–27 (2013)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Completeness Theorem for Probabilistic Regular Expressions;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras;Lecture Notes in Computer Science;2024
3. Behavioural Preorders via Graded Monads;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29
4. Combining Semilattices and Semimodules;Lecture Notes in Computer Science;2021
5. Iterated Covariant Powerset is not a Monad;Electronic Notes in Theoretical Computer Science;2018-12