Author:
Kozen Dexter,Mamouras Konstantinos,Petrişan Daniela,Silva Alexandra
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Adámek, J.: On final coalgebras of continuous functors. TCS 294(12), 3–29 (2003)
2. Lecture Notes in Computer Science;C Allauzen,2006
3. Bojanczyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. LMCS 10(3) (2014)
4. Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: POPL 2013, pp. 457–468 (2013)
5. Braibant, T., Pous, D.: Deciding Kleene algebras in Coq. LMCS 8(1:16), 1–42 (2012)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Theory of Formal Choreographic Languages;Logical Methods in Computer Science;2023-08-02
2. Fast Coalgebraic Bisimilarity Minimization;Proceedings of the ACM on Programming Languages;2023-01-09
3. Residuality and Learning for Nondeterministic Nominal Automata;Logical Methods in Computer Science;2022-02-03
4. Coalgebraic Semantics for Nominal Automata;Coalgebraic Methods in Computer Science;2022
5. Automata Learning;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08