References

  1. JiříAdámek, Filippo Bonchi, Mathias Hülsbusch, Barbara König, Stefan Milius & Alexandra Silva (2012): A coalgebraic perspective on minimization and determinization. In: International Conference on Foundations of Software Science and Computational Structures. Springer, pp. 58–73, doi:10.1007/978-3-642-28729-9_4.
  2. Dana Angluin (1987): Learning regular sets from queries and counterexamples. Information and computation 75(2), pp. 87–106, doi:10.1016/0890-5401(87)90052-6.
  3. Dana Angluin, Sarah Eisenstat & Dana Fisman (2015): Learning regular languages via alternating automata. In: IJCAI, pp. 3308–3314.
  4. Michael A Arbib & Ernest G Manes (1975): Fuzzy machines in a category. Bulletin of the Australian Mathematical Society 13(2), pp. 169–210, doi:10.1017/S0004972700024412.
  5. Steve Awodey (2010): Category theory. Oxford university press.
  6. Jon Beck (1969): Distributive laws. In: Seminar on triples and categorical homology theory. Springer, pp. 119–140, doi:10.1007/BFb0083084.
  7. Sebastian Berndt, Maciej Li\'skiewicz, Matthias Lutter & Rüdiger Reischuk (2017): Learning residual alternating automata. In: Thirty-First AAAI Conference on Artificial Intelligence.
  8. Filippo Bonchi, Marcello M Bonsangue, Helle H Hansen, Prakash Panangaden, Jan JMM Rutten & Alexandra Silva (2014): Algebra-coalgebra duality in Brzozowski's minimization algorithm. ACM Transactions on Computational Logic (TOCL) 15(1), pp. 1–29, doi:10.1145/2490818.
  9. Filippo Bonchi, Marcello M Bonsangue, Jan JMM Rutten & Alexandra Silva (2012): Brzozowskis algorithm (co) algebraically. In: Logic and Program Semantics. Springer, pp. 12–23, doi:10.1007/978-3-642-29485-3_2.
  10. Marcello M Bonsangue, Helle Hvid Hansen, Alexander Kurz & Jurriaan Rot (2013): Presenting distributive laws. In: International Conference on Algebra and Coalgebra in Computer Science. Springer, pp. 95–109, doi:10.1007/978-3-642-40206-7_9.
  11. Janusz A Brzozowski (1962): Canonical regular expressions and minimal state graphs for definite events. In: Proc. Symposium of Mathematical Theory of Automata, pp. 529–561.
  12. Janusz A. Brzozowski & Hellis Tamm (2014): Theory of átomata. Theor. Comput. Sci. 539, pp. 13–27, doi:10.1016/j.tcs.2014.04.016.
  13. François Denis, Aurélien Lemay & Alain Terlutte (2001): Residual finite state automata. In: STACS 2001. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 144–157, doi:10.1007/3-540-44693-1_13.
  14. Samuel Eilenberg & John C Moore (1965): Adjoint functors and triples. Illinois Journal of Mathematics 9(3), pp. 381–398, doi:10.1215/ijm/1256068141.
  15. Yann Esposito, Aurélien Lemay, François Denis & Pierre Dupont (2002): Learning probabilistic residual finite state automata. In: International Colloquium on Grammatical Inference. Springer, pp. 77–91, doi:10.1007/3-540-45790-9_7.
  16. Helle Hvid Hansen, Clemens Kupke & Raul Andres Leal (2014): Strong completeness for iteration-free coalgebraic dynamic logics. In: IFIP International Conference on Theoretical Computer Science. Springer, pp. 281–295, doi:10.1007/978-3-662-44602-7_22.
  17. Gerco van Heerdt (2016): An abstract automata learning framework. Radboud University Nijmegen.
  18. Gerco van Heerdt (2020): CALF: Categorical automata learning framework. University College London.
  19. Gerco van Heerdt, Joshua Moerman, Matteo Sammartino & Alexandra Silva (2019): A (co)algebraic theory of succinct automata. J. Log. Algebraic Methods Program. 105, pp. 112–125, doi:10.1016/j.jlamp.2019.02.008.
  20. Gerco van Heerdt, Matteo Sammartino & Alexandra Silva (2020): Learning automata with side-effects. In: Coalgebraic Methods in Computer Science - 15th IFIP WG 1.3 International Workshop, CMCS 2020, Colocated with ETAPS 2020, Dublin, Ireland, April 25-26, 2020, Proceedings, Lecture Notes in Computer Science 12094. Springer, pp. 68–89, doi:10.1007/978-3-030-57201-3_5.
  21. Bart Jacobs (2006): A bialgebraic review of deterministic automata, regular expressions and languages, pp. 375–404. Springer Berlin Heidelberg, Berlin, Heidelberg, doi:10.1007/11780274_20.
  22. Bart Jacobs (2011): Bases as coalgebras. In: International conference on algebra and coalgebra in computer science. Springer, pp. 237–252, doi:10.2168/LMCS-9(3:23)2013.
  23. Bart Jacobs (2015): A recipe for state-and-effect triangles. In: 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, doi:10.4230/LIPIcs.CALCO.2015.116.
  24. Bart Jacobs, Alexandra Silva & Ana Sokolova (2012): Trace semantics via determinization. In: International Workshop on Coalgebraic Methods in Computer Science. Springer, pp. 109–129, doi:10.1007/978-3-642-32784-1_7.
  25. Bart Jacobs, Alexandra Silva & Ana Sokolova (2015): Trace semantics via determinization. Journal of Computer and System Sciences 81(5), pp. 859–879, doi:10.1016/j.jcss.2014.12.005.
  26. Bartek Klin (2004): A coalgebraic approach to process equivalence and a coinduction principle for traces. Electronic Notes in Theoretical Computer Science 106, pp. 201–218, doi:10.1016/j.entcs.2004.02.029.
  27. Bartek Klin & Beata Nachyla (2015): Presenting morphisms of distributive laws. In: 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
  28. Fred EJ Linton (1966): Some aspects of equational categories. In: Proceedings of the Conference on Categorical Algebra. Springer, pp. 84–94, doi:10.1007/978-3-642-99902-4_3.
  29. Joshua Moerman & Matteo Sammartino (2020): Residual nominal automata. In: CONCUR 171, pp. 44:1–44:21, doi:10.4230/LIPIcs.CONCUR.2020.44.
  30. Eugenio Moggi (1988): Computational lambda-calculus and monads. University of Edinburgh, Department of Computer Science, Laboratory for Foundations of Computer Science.
  31. Eugenio Moggi (1990): An abstract view of programming languages. University of Edinburgh, Department of Computer Science, Laboratory for Foundations of Computer Science.
  32. Eugenio Moggi (1991): Notions of computation and monads. Information and computation 93(1), pp. 55–92, doi:10.1016/0890-5401(91)90052-4.
  33. Robert S. R. Myers, Jiri Adamek, Stefan Milius & Henning Urbat (2015): Coalgebraic constructions of canonical nondeterministic automata. Theor. Comput. Sci. 604, pp. 81–101, doi:10.1016/j.tcs.2015.03.035.
  34. Anil Nerode (1958): Linear automaton transformations. Proceedings of the American Mathematical Society 9(4), pp. 541–544, doi:10.1090/S0002-9939-1958-0135681-9.
  35. John Power & Hiroshi Watanabe (2002): Combining a monad and a comonad. Theoretical Computer Science 280(1-2), pp. 137–162, doi:10.1016/S0304-3975(01)00024-X.
  36. Jan Rutten, Marcello Bonsangue, Filippo Bonchi & Alexandra Silva (2013): Generalizing determinization from automata to coalgebras. Logical Methods in Computer Science 9, doi:10.2168/LMCS-9(1:9)2013.
  37. Jan JMM Rutten (2000): Universal coalgebra: a theory of systems. Theoretical computer science 249(1), pp. 3–80, doi:10.1016/S0304-3975(00)00056-6.
  38. Lutz Schröder (2008): Expressivity of coalgebraic modal logic: The limits and beyond. Theoretical Computer Science 390(2-3), pp. 230–247, doi:10.1016/j.tcs.2007.09.023.
  39. Alexandra Silva, Filippo Bonchi, Marcello M Bonsangue & Jan JMM Rutten (2010): Generalizing the powerset construction, coalgebraically. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
  40. Ross Street (2009): Weak distributive laws.. Theory and Applications of Categories [electronic only] 22, pp. 313–320.
  41. Paul Taylor (2002): Subspaces in abstract stone duality. Theory and Applications of Categories 10(13), pp. 301–368.
  42. Jean Vuillemin & Nicolas Gama (2010): Efficient equivalence and minimization for non deterministic xor automata.
  43. Hiroshi Watanabe (2002): Well-behaved translations between structural operational semantics. Electronic Notes in Theoretical Computer Science 65(1), pp. 337–357, doi:10.1016/S1571-0661(04)80372-4.
  44. Stefan Zetzsche, Gerco van Heerdt, Matteo Sammartino & Alexandra Silva (2021): Canonical automata via distributive law homomorphisms. arXiv preprint arXiv:2104.13421.
  45. Maaike Zwart & Dan Marsden (2019): No-go theorems for distributive laws. In: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, pp. 1–13, doi:10.1109/LICS.2019.8785707.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org