{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T07:48:03Z","timestamp":1771573683130,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":62,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,8]]},"DOI":"10.1145\/3373718.3394775","type":"proceedings-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:23:18Z","timestamp":1590452598000},"page":"900-914","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Automata Learning"],"prefix":"10.1145","author":[{"given":"Henning","family":"Urbat","sequence":"first","affiliation":[{"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg, Erlangen, Germany"}]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[{"name":"Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg, Erlangen, Germany"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Foundations of Software Science and Computational Structures","author":"Ad\u00e1mek Ji\u0159\u00ed","unstructured":"Ji\u0159\u00ed Ad\u00e1mek , Filippo Bonchi , Mathias H\u00fclsbusch , Barbara K\u00f6nig , Stefan Milius , and Alexandra Silva . 2012. A Coalgebraic Perspective on Minimization and Determinization . In Foundations of Software Science and Computational Structures , Lars Birkedal (Ed.). Springer Berlin Heidelberg , 58--73. Ji\u0159\u00ed Ad\u00e1mek, Filippo Bonchi, Mathias H\u00fclsbusch, Barbara K\u00f6nig, Stefan Milius, and Alexandra Silva. 2012. A Coalgebraic Perspective on Minimization and Determinization. In Foundations of Software Science and Computational Structures, Lars Birkedal (Ed.). Springer Berlin Heidelberg, 58--73."},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. Mathematical Foundations of Programming Science (MFPS XXX) (Electron. Notes Theor. Comput. Sci.)","author":"Ad\u00e1mek Ji\u0159\u00ed","unstructured":"Ji\u0159\u00ed Ad\u00e1mek , Stefan Milius , Robert S. R. Myers , and Henning Urbat . 2014. On Continuous Nondeterminism and State Minimality . In Proc. Mathematical Foundations of Programming Science (MFPS XXX) (Electron. Notes Theor. Comput. Sci.) , Bart Jacobs, Alexandra Silva, and Sam Staton (Eds.), Vol. 308 . Elsevier , 3--23. Ji\u0159\u00ed Ad\u00e1mek, Stefan Milius, Robert S. R. Myers, and Henning Urbat. 2014. On Continuous Nondeterminism and State Minimality. In Proc. Mathematical Foundations of Programming Science (MFPS XXX) (Electron. Notes Theor. Comput. Sci.), Bart Jacobs, Alexandra Silva, and Sam Staton (Eds.), Vol. 308. Elsevier, 3--23."},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. CALCO'15 (LIPIcs). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik.","author":"Ad\u00e1mek J.","unstructured":"J. Ad\u00e1mek , S. Milius , and H. Urbat . 2015. Syntactic Monoids in a Category . In Proc. CALCO'15 (LIPIcs). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. J. Ad\u00e1mek, S. Milius, and H. Urbat. 2015. Syntactic Monoids in a Category. In Proc. CALCO'15 (LIPIcs). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_4_1","volume-title":"Automata and Algebras in Categories","author":"Ad\u00e1mek Ji\u0159\u00ed","unstructured":"Ji\u0159\u00ed Ad\u00e1mek and Vera Trnkov\u00e1 . 1989. Automata and Algebras in Categories . Springer . Ji\u0159\u00ed Ad\u00e1mek and Vera Trnkov\u00e1. 1989. Automata and Algebras in Categories. Springer."},{"key":"e_1_3_2_1_5_1","first-page":"589","article-title":"Free algebras and automata realizations in the language of categories","volume":"15","author":"Ad\u00e1mek Ji\u0159\u00ed","year":"1974","unstructured":"Ji\u0159\u00ed Ad\u00e1mek . 1974 . Free algebras and automata realizations in the language of categories . Commentationes Mathematicae Universitatis Carolinae 15 , 4 (1974), 589 -- 602 . http:\/\/eudml.org\/doc\/16649 Ji\u0159\u00ed Ad\u00e1mek. 1974. Free algebras and automata realizations in the language of categories. Commentationes Mathematicae Universitatis Carolinae 15, 4 (1974), 589--602. http:\/\/eudml.org\/doc\/16649","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. DLT","author":"Boja\u0144czyk Miko\u0142aj","year":"2015","unstructured":"Miko\u0142aj Boja\u0144czyk . 2015. Recognisable languages over monads . In Proc. DLT 2015 , Igor Potapov (Ed.). LNCS, Vol. 9168 . Springer , 1--13. http:\/\/arxiv.org\/abs\/1502.04898. Miko\u0142aj Boja\u0144czyk. 2015. Recognisable languages over monads. In Proc. DLT 2015, Igor Potapov (Ed.). LNCS, Vol. 9168. Springer, 1--13. http:\/\/arxiv.org\/abs\/1502.04898."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.07.031"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(75)90028-6"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/00927878608823393"},{"key":"e_1_3_2_1_11_1","volume-title":"Learning Weighted Automata","author":"Balle Borja","unstructured":"Borja Balle and Mehryar Mohri . 2015. Learning Weighted Automata . In Algebraic Informatics, Andreas Maletti (Ed.). Springer , 1--21. Borja Balle and Mehryar Mohri. 2015. Learning Weighted Automata. In Algebraic Informatics, Andreas Maletti (Ed.). Springer, 1--21."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1976-060-2"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17127-8_4"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01111838"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Nick Bezhanishvili Clemens Kupke and Prakash Panangaden. 2012. Minimization via Duality. In Logic Language Information and Computation Luke Ong and Ruy de Queiroz (Eds.). Springer Berlin Heidelberg 191--205.  Nick Bezhanishvili Clemens Kupke and Prakash Panangaden. 2012. Minimization via Duality. In Logic Language Information and Computation Luke Ong and Ruy de Queiroz (Eds.). Springer Berlin Heidelberg 191--205.","DOI":"10.1007\/978-3-642-32621-9_14"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80030-X"},{"key":"e_1_3_2_1_17_1","volume-title":"Automata theory in nominal sets. Log. Methods Comput. Sci. 10, 3:4","author":"Boja\u0144czyk Miko\u0142aj","year":"2014","unstructured":"Miko\u0142aj Boja\u0144czyk , Bartek Klin , and S\u0142awomir Lasota . 2014. Automata theory in nominal sets. Log. Methods Comput. Sci. 10, 3:4 ( 2014 ), 44 pp. Miko\u0142aj Boja\u0144czyk, Bartek Klin, and S\u0142awomir Lasota. 2014. Automata theory in nominal sets. Log. Methods Comput. Sci. 10, 3:4 (2014), 44 pp."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-013-9464-1"},{"key":"e_1_3_2_1_19_1","volume-title":"Angluin-Style Learning of NFA. In 21st International Joint Conference on Artifical Intelligence (IJCAI'09)","author":"Bollig Benedikt","year":"2009","unstructured":"Benedikt Bollig , Peter Habermehl , Carsten Kern , and Martin Leucker . 2009 . Angluin-Style Learning of NFA. In 21st International Joint Conference on Artifical Intelligence (IJCAI'09) . Benedikt Bollig, Peter Habermehl, Carsten Kern, and Martin Leucker. 2009. Angluin-Style Learning of NFA. In 21st International Joint Conference on Artifical Intelligence (IJCAI'09)."},{"key":"e_1_3_2_1_20_1","volume-title":"A Robust Class of Data Languages and an Application to Learning. Logical Methods in Computer Science 10, 4","author":"Bollig Benedikt","year":"2014","unstructured":"Benedikt Bollig , Peter Habermehl , Martin Leucker , and Benjamin Monmege . 2014. A Robust Class of Data Languages and an Application to Learning. Logical Methods in Computer Science 10, 4 ( 2014 ). Benedikt Bollig, Peter Habermehl, Martin Leucker, and Benjamin Monmege. 2014. A Robust Class of Data Languages and an Application to Learning. Logical Methods in Computer Science 10, 4 (2014)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Thomas Colcombet. 2009. The Theory of Stabilisation Monoids and Regular Cost Functions. In Automata Languages and Programming Susanne Albers Alberto Marchetti-Spaccamela Yossi Matias Sotiris Nikoletseas and Wolfgang Thomas (Eds.). Springer Berlin Heidelberg 139--150.  Thomas Colcombet. 2009. The Theory of Stabilisation Monoids and Regular Cost Functions. In Automata Languages and Programming Susanne Albers Alberto Marchetti-Spaccamela Yossi Matias Sotiris Nikoletseas and Wolfgang Thomas (Eds.). Springer Berlin Heidelberg 139--150.","DOI":"10.1007\/978-3-642-02930-1_12"},{"key":"e_1_3_2_1_22_1","volume-title":"7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), Filippo Bonchi and Barbara K\u00f6nig (Eds.)","volume":"72","author":"Colcombet Thomas","year":"2017","unstructured":"Thomas Colcombet and Daniela Petri\u015fan . 2017 . Automata Minimization: a Functorial Approach . In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), Filippo Bonchi and Barbara K\u00f6nig (Eds.) , Vol. 72 . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 8:1--8:16. Thomas Colcombet and Daniela Petri\u015fan. 2017. Automata Minimization: a Functorial Approach. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017) (Leibniz International Proceedings in Informatics (LIPIcs)), Filippo Bonchi and Barbara K\u00f6nig (Eds.), Vol. 72. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 8:1--8:16."},{"key":"e_1_3_2_1_23_1","unstructured":"H. Comon M. Dauchet R. Gilleron C. L\u00f6ding F. Jacquemard D. Lugiez S. Tison and M. Tommasi. 2007. Tree Automata Techniques and Applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata.  H. Comon M. Dauchet R. Gilleron C. L\u00f6ding F. Jacquemard D. Lugiez S. Tison and M. Tommasi. 2007. Tree Automata Techniques and Applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata."},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. STACS 2016 (LIPIcs), N. Ollinger and H. Vollmer (Eds.)","volume":"47","author":"Daviaud L.","year":"2016","unstructured":"L. Daviaud , D. Kuperberg , and J.-\u00c9. Pin. 2016 . Varieties of Cost Functions . In Proc. STACS 2016 (LIPIcs), N. Ollinger and H. Vollmer (Eds.) , Vol. 47 . Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 30:1--30:14. L. Daviaud, D. Kuperberg, and J.-\u00c9. Pin. 2016. Varieties of Cost Functions. In Proc. STACS 2016 (LIPIcs), N. Ollinger and H. Vollmer (Eds.), Vol. 47. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 30:1--30:14."},{"key":"e_1_3_2_1_25_1","volume-title":"Formal Methods - The Next 30 Years, Maurice H. ter Beek, Annabelle McIver, and Jos\u00e9 N","author":"Deifel Hans-Peter","unstructured":"Hans-Peter Deifel , Stefan Milius , Lutz Schr\u00f6der , and Thorsten Wi\u00df-mann. 2019. Generic Partition Refinement and Weighted Tree Automata . In Formal Methods - The Next 30 Years, Maurice H. ter Beek, Annabelle McIver, and Jos\u00e9 N . Oliveira (Eds.). Springer International Publishing , 280--297. Hans-Peter Deifel, Stefan Milius, Lutz Schr\u00f6der, and Thorsten Wi\u00df-mann. 2019. Generic Partition Refinement and Weighted Tree Automata. In Formal Methods - The Next 30 Years, Maurice H. ter Beek, Annabelle McIver, and Jos\u00e9 N. Oliveira (Eds.). Springer International Publishing, 280--297."},{"key":"e_1_3_2_1_26_1","volume-title":"Residual Finite State Automata. In STACS","author":"Denis Fran\u00e7ois","year":"2001","unstructured":"Fran\u00e7ois Denis , Aur\u00e9lien Lemay , and Alain Terlutte . 2001 . Residual Finite State Automata. In STACS 2001, Afonso Ferreira and Horst Reichel (Eds.). 144--157. Fran\u00e7ois Denis, Aur\u00e9lien Lemay, and Alain Terlutte. 2001. Residual Finite State Automata. In STACS 2001, Afonso Ferreira and Horst Reichel (Eds.). 144--157."},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. 28th International Conference on Concurrency Theory (CONCUR 2017)","author":"Dorsch Ulrich","year":"2017","unstructured":"Ulrich Dorsch , Stefan Milius , Lutz Schr\u00f6der , and Thorsten Wi\u00df-mann. 2017 . Efficient Coalgebraic Partition Refinement . In Proc. 28th International Conference on Concurrency Theory (CONCUR 2017) (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https:\/\/arxiv.org\/abs\/1705 08362 Ulrich Dorsch, Stefan Milius, Lutz Schr\u00f6der, and Thorsten Wi\u00df-mann. 2017. Efficient Coalgebraic Partition Refinement. In Proc. 28th International Conference on Concurrency Theory (CONCUR 2017) (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https:\/\/arxiv.org\/abs\/1705 08362"},{"key":"e_1_3_2_1_28_1","volume-title":"Developments in Language Theory, Zolt\u00e1n \u00c9sik and Zolt\u00e1n F\u00fcl\u00f6p (Eds.)","author":"Drewes Frank","unstructured":"Frank Drewes and Johanna H\u00f6gberg . 2003. Learning a Regular Tree Language from a Teacher . In Developments in Language Theory, Zolt\u00e1n \u00c9sik and Zolt\u00e1n F\u00fcl\u00f6p (Eds.) . Springer Berlin Heidelberg , 279--291. Frank Drewes and Johanna H\u00f6gberg. 2003. Learning a Regular Tree Language from a Teacher. In Developments in Language Theory, Zolt\u00e1n \u00c9sik and Zolt\u00e1n F\u00fcl\u00f6p (Eds.). Springer Berlin Heidelberg, 279--291."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"M. Droste W. Kuich and H. Vogler (Eds.). 2009. Handbook of weighted automata. Springer.  M. Droste W. Kuich and H. Vogler (Eds.). 2009. Handbook of weighted automata. Springer.","DOI":"10.1007\/978-3-642-01492-5"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_2"},{"key":"e_1_3_2_1_31_1","volume-title":"FOSSACS 2011 (LNCS)","volume":"6604","author":"Gabbay Murdoch James","year":"2011","unstructured":"Murdoch James Gabbay and Vincenzo Ciancia . 2011 . Freshness and Name-Restriction in Sets of Traces with Names. In Foundations of Software Science and Computational Structures , FOSSACS 2011 (LNCS) , Vol. 6604 . Springer, 365--380. https:\/\/doi.org\/10.1007\/978--3-642-- 19805--2 10.1007\/978--3-642--19805--2 Murdoch James Gabbay and Vincenzo Ciancia. 2011. Freshness and Name-Restriction in Sets of Traces with Names. In Foundations of Software Science and Computational Structures, FOSSACS 2011 (LNCS), Vol. 6604. Springer, 365--380. https:\/\/doi.org\/10.1007\/978--3-642--19805--2"},{"key":"e_1_3_2_1_32_1","volume-title":"CSL 2015 (LIPIcs)","volume":"41","author":"Gabbay Murdoch James","year":"2015","unstructured":"Murdoch James Gabbay , Dan R. Ghica , and Daniela Petri\u015fan . 2015 . Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes. In Computer Science Logic , CSL 2015 (LIPIcs) , Vol. 41 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 374--389. Murdoch James Gabbay, Dan R. Ghica, and Daniela Petri\u015fan. 2015. Leaving the Nest: Nominal Techniques for Variables with Interleaving Scopes. In Computer Science Logic, CSL 2015 (LIPIcs), Vol. 41. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 374--389."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(75)80012-2"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2725"},{"key":"e_1_3_2_1_35_1","volume-title":"Automata Learning: A Categorical Perspective","author":"Jacobs Bart","year":"2014","unstructured":"Bart Jacobs and Alexandra Silva . 2014 . Automata Learning: A Categorical Perspective . Springer , 384--406. Bart Jacobs and Alexandra Silva. 2014. Automata Learning: A Categorical Perspective. Springer, 384--406."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90242-9"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.06.005"},{"key":"e_1_3_2_1_38_1","volume-title":"ICALP 2015 (LNCS)","volume":"9135","author":"Kozen Dexter","year":"2015","unstructured":"Dexter Kozen , Konstantinos Mamouras , Daniela Petri\u015fan , and Alexandra Silva . 2015 . Nominal Kleene Coalgebra. In Automata, Languages, and Programming , ICALP 2015 (LNCS) , Vol. 9135 . Springer, 286--298. https:\/\/doi.org\/10.1007\/978--3-662--47666--6 10.1007\/978--3-662--47666--6 Dexter Kozen, Konstantinos Mamouras, Daniela Petri\u015fan, and Alexandra Silva. 2015. Nominal Kleene Coalgebra. In Automata, Languages, and Programming, ICALP 2015 (LNCS), Vol. 9135. Springer, 286--298. https:\/\/doi.org\/10.1007\/978--3-662--47666--6"},{"key":"e_1_3_2_1_39_1","volume-title":"Categories for the Working Mathematician","author":"Mac Lane S.","unstructured":"S. Mac Lane . 1998. Categories for the Working Mathematician ( 2 nd ed.). Springer . S.Mac Lane. 1998. Categories for the Working Mathematician (2nd ed.). Springer.","edition":"2"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1070"},{"key":"e_1_3_2_1_41_1","volume-title":"Algebraic Theories. Graduate Texts in Mathematics","author":"Manes E. G.","unstructured":"E. G. Manes . 1976. Algebraic Theories. Graduate Texts in Mathematics , Vol. 26 . Springer . E. G. Manes. 1976. Algebraic Theories. Graduate Texts in Mathematics, Vol. 26. Springer."},{"key":"e_1_3_2_1_42_1","volume-title":"Proc. 14th International Conference on Grammatical Inference 2018 (Proceedings of Machine Learning Research), Olgierd Unold, Witold Dyrka, and Wojciech Wieczorek (Eds.)","volume":"93","author":"Moerman Joshua","year":"2019","unstructured":"Joshua Moerman . 2019 . Learning Product Automata . In Proc. 14th International Conference on Grammatical Inference 2018 (Proceedings of Machine Learning Research), Olgierd Unold, Witold Dyrka, and Wojciech Wieczorek (Eds.) , Vol. 93 . PMLR, 54--66. Joshua Moerman. 2019. Learning Product Automata. In Proc. 14th International Conference on Grammatical Inference 2018 (Proceedings of Machine Learning Research), Olgierd Unold, Witold Dyrka, and Wojciech Wieczorek (Eds.), Vol. 93. PMLR, 54--66."},{"key":"e_1_3_2_1_43_1","volume-title":"Separation and Renaming in Nominal Sets. CoRR abs\/1906.00763","author":"Moerman Joshua","year":"2019","unstructured":"Joshua Moerman and Jurriaan Rot . 2019. Separation and Renaming in Nominal Sets. CoRR abs\/1906.00763 ( 2019 ). arXiv:1906.00763 Joshua Moerman and Jurriaan Rot. 2019. Separation and Renaming in Nominal Sets. CoRR abs\/1906.00763 (2019). arXiv:1906.00763"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009879"},{"key":"e_1_3_2_1_45_1","volume-title":"Proc. Coalgebraic Methods in Computer Science (CMCS'14) (Lecture Notes Comput. Sci.), Marcello M","author":"Myers Robert S. R.","unstructured":"Robert S. R. Myers , Ji\u0159\u00ed Ad\u00e1mek , Stefan Milius , and Henning Urbat . 2014. Canonical Nondeterministic Automata . In Proc. Coalgebraic Methods in Computer Science (CMCS'14) (Lecture Notes Comput. Sci.), Marcello M . Bonsangue (Ed.), Vol. 8446 . Springer , 189--210. Robert S. R. Myers, Ji\u0159\u00ed Ad\u00e1mek, Stefan Milius, and Henning Urbat. 2014. Canonical Nondeterministic Automata. In Proc. Coalgebraic Methods in Computer Science (CMCS'14) (Lecture Notes Comput. Sci.), Marcello M. Bonsangue (Ed.), Vol. 8446. Springer, 189--210."},{"key":"e_1_3_2_1_46_1","unstructured":"D. Perrin and J.-\u00c9. Pin. 2004. Infinite Words. Elsevier.  D. Perrin and J.-\u00c9. Pin. 2004. Infinite Words. Elsevier."},{"key":"e_1_3_2_1_47_1","volume-title":"Mathematical Foundations of Automata Theory. (November","year":"2016","unstructured":"J.-\u00c9. Pin. 2016. Mathematical Foundations of Automata Theory. (November 2016 ). Available at http:\/\/www.liafa.jussieu.fr\/~jep\/PDF\/MPRI\/MPRI.pdf. J.-\u00c9. Pin. 2016. Mathematical Foundations of Automata Theory. (November 2016). Available at http:\/\/www.liafa.jussieu.fr\/~jep\/PDF\/MPRI\/MPRI.pdf."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/2512979"},{"key":"e_1_3_2_1_49_1","volume-title":"Proc. MFCS'01 (LNCS)","author":"Pol\u00e1k L.","unstructured":"L. Pol\u00e1k . 2001. Syntactic semiring of a language . In Proc. MFCS'01 (LNCS) , J. Sgall, A. Pultr, and P. Kolman (Eds.), Vol. 2136 . Springer , 611--620. L. Pol\u00e1k. 2001. Syntactic semiring of a language. In Proc. MFCS'01 (LNCS), J. Sgall, A. Pultr, and P. Kolman (Eds.), Vol. 2136. Springer, 611--620."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.32.0114"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(80)90097-6"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00056-6"},{"key":"e_1_3_2_1_53_1","volume-title":"FOSSACS 2017 (LNCS)","volume":"10203","author":"Schr\u00f6der Lutz","year":"2017","unstructured":"Lutz Schr\u00f6der , Dexter Kozen , Stefan Milius , and Thorsten Wi\u00df-mann. 2017 . Nominal Automata with Name Binding. In Foundations of Software Science and Computation Structures , FOSSACS 2017 (LNCS) , Vol. 10203 . Springer, 124--142. https:\/\/doi.org\/10.1007\/978--3-662--54458--7 10.1007\/978--3-662--54458--7 Lutz Schr\u00f6der, Dexter Kozen, Stefan Milius, and Thorsten Wi\u00df-mann. 2017. Nominal Automata with Name Binding. In Foundations of Software Science and Computation Structures, FOSSACS 2017 (LNCS), Vol. 10203. Springer, 124--142. https:\/\/doi.org\/10.1007\/978--3-662--54458--7"},{"key":"e_1_3_2_1_54_1","volume-title":"Eilenberg Theorems for Free. CoRR abs\/1602.05831","author":"Urbat Henning","year":"2017","unstructured":"Henning Urbat , Jir\u00ed Ad\u00e1mek , Liang-Ting Chen , and Stefan Milius . 2017. Eilenberg Theorems for Free. CoRR abs\/1602.05831 ( 2017 ). http:\/\/arxiv.org\/abs\/1602.05831 Henning Urbat, Jir\u00ed Ad\u00e1mek, Liang-Ting Chen, and Stefan Milius. 2017. Eilenberg Theorems for Free. CoRR abs\/1602.05831 (2017). http:\/\/arxiv.org\/abs\/1602.05831"},{"key":"e_1_3_2_1_55_1","volume-title":"Proc. MFCS 2017 (LIPIcs), Kim G. Larsen, Hans L. Bodlaender, and Jean-Fran\u00e7ois Raskin (Eds.)","volume":"83","author":"Urbat Henning","year":"2017","unstructured":"Henning Urbat , Ji\u0159\u00ed Ad\u00e1mek , Liang-Ting Chen , and Stefan Milius . 2017 . Eilenberg Theorems for Free . In Proc. MFCS 2017 (LIPIcs), Kim G. Larsen, Hans L. Bodlaender, and Jean-Fran\u00e7ois Raskin (Eds.) , Vol. 83 . Schloss Dagstuhl. Henning Urbat, Ji\u0159\u00ed Ad\u00e1mek, Liang-Ting Chen, and Stefan Milius. 2017. Eilenberg Theorems for Free. In Proc. MFCS 2017 (LIPIcs), Kim G. Larsen, Hans L. Bodlaender, and Jean-Fran\u00e7ois Raskin (Eds.), Vol. 83. Schloss Dagstuhl."},{"key":"e_1_3_2_1_56_1","volume-title":"Proc. 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)","volume":"132","author":"Urbat Henning","year":"2019","unstructured":"Henning Urbat and Stefan Milius . 2019 . Varieties of Data Languages . In Proc. 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) (LIPIcs), Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi (Eds.) , Vol. 132 . 130:1--130:14. R@(Presents the first Eilenberg-type correspondence for data languages and a nominal Eilenberg-Sch\u00fctzenberger theorem characterizing pseudovarieties of nominal monoids.). Henning Urbat and Stefan Milius. 2019. Varieties of Data Languages. In Proc. 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) (LIPIcs), Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi (Eds.), Vol. 132. 130:1--130:14. R@(Presents the first Eilenberg-type correspondence for data languages and a nominal Eilenberg-Sch\u00fctzenberger theorem characterizing pseudovarieties of nominal monoids.)."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373718.3394775"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2967606"},{"key":"e_1_3_2_1_59_1","volume-title":"Tree Automata as Algebras: Minimisation and Determinisation. CoRR abs\/1904.08802","author":"van Heerdt Gerco","year":"2019","unstructured":"Gerco van Heerdt , Tobias Kapp\u00e9 , Jurriaan Rot , Matteo Sammartino , and Alexandra Silva . 2019. Tree Automata as Algebras: Minimisation and Determinisation. CoRR abs\/1904.08802 ( 2019 ). http:\/\/arxiv.org\/abs\/1904.08802 Gerco van Heerdt, Tobias Kapp\u00e9, Jurriaan Rot, Matteo Sammartino, and Alexandra Silva. 2019. Tree Automata as Algebras: Minimisation and Determinisation. CoRR abs\/1904.08802 (2019). http:\/\/arxiv.org\/abs\/1904.08802"},{"key":"e_1_3_2_1_60_1","volume-title":"Proc. CSL","author":"van Heerdt Gerco","year":"2017","unstructured":"Gerco van Heerdt , Matteo Sammartino , and Alexandra Silva . 2017 . CALF: Categorical Automata Learning Framework . In Proc. CSL 2017. 29:1--29:24. Gerco van Heerdt, Matteo Sammartino, and Alexandra Silva. 2017. CALF: Categorical Automata Learning Framework. In Proc. CSL 2017. 29:1--29:24."},{"key":"e_1_3_2_1_61_1","volume-title":"Learning Automata with Side-Effects. CoRR abs\/1704.08055","author":"van Heerdt Gerco","year":"2017","unstructured":"Gerco van Heerdt , Matteo Sammartino , and Alexandra Silva . 2017. Learning Automata with Side-Effects. CoRR abs\/1704.08055 ( 2017 ). http:\/\/arxiv.org\/abs\/1704.08055 Gerco van Heerdt, Matteo Sammartino, and Alexandra Silva. 2017. Learning Automata with Side-Effects. CoRR abs\/1704.08055 (2017). http:\/\/arxiv.org\/abs\/1704.08055"},{"key":"e_1_3_2_1_62_1","volume-title":"Proc. ICALP'91 (LNCS)","author":"Wilke T.","unstructured":"T. Wilke . 1991. An Eilenberg Theorem for \u221e-Languages . In Proc. ICALP'91 (LNCS) , Vol. 510 . Springer , 588--599. T. Wilke. 1991. An Eilenberg Theorem for \u221e-Languages. In Proc. ICALP'91 (LNCS), Vol. 510. Springer, 588--599."}],"event":{"name":"LICS '20: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Saarbr\u00fccken Germany","acronym":"LICS '20","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"]},"container-title":["Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394775","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373718.3394775","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:35Z","timestamp":1750197755000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394775"}},"subtitle":["An Algebraic Approach"],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":62,"alternative-id":["10.1145\/3373718.3394775","10.1145\/3373718"],"URL":"https:\/\/doi.org\/10.1145\/3373718.3394775","relation":{},"subject":[],"published":{"date-parts":[[2020,7,8]]},"assertion":[{"value":"2020-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}