{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T10:24:16Z","timestamp":1762338256761},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319068794"},{"type":"electronic","value":"9783319068800"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06880-0_20","type":"book-chapter","created":{"date-parts":[[2014,5,23]],"date-time":"2014-05-23T00:26:34Z","timestamp":1400804794000},"page":"384-406","source":"Crossref","is-referenced-by-count":12,"title":["Automata Learning: A Categorical Perspective"],"prefix":"10.1007","author":[{"given":"Bart","family":"Jacobs","sequence":"first","affiliation":[]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Aarts, F.: Inference and abstraction of communication protocols. Master\u2019s thesis, Radboud University Nijmegen and Uppsala University (2009)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Aarts, F., de Ruiter, J., Poll, E.: Formal models of bank cards for free. In: ICST Workshops, pp. 461\u2013468. IEEE (2013)","DOI":"10.1109\/ICSTW.2013.60"},{"key":"20_CR3","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley (1974)"},{"issue":"2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput.\u00a075(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Angluin, D., Cs\u00fcr\u00f6s, M.: Learning Markov chains with variable memory length from noisy output. In: Freund, Y., Schapire, R.E. (eds.) COLT, pp. 298\u2013308. ACM (1997)","DOI":"10.1145\/267460.267517"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0022-4049(75)90028-6","volume":"6","author":"M.A. Arbib","year":"1975","unstructured":"Arbib, M.A., Manes, E.G.: Adjoint machines, state-behavior machines, and duality. Journal of Pure and Applied Algebra\u00a06(3), 313\u2013344 (1975)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Barr, M., Wells, C.: Toposes, Triples and Theories. Springer, Berlin (1985) Revized and corrected version available from URL, www.cwru.edu\/artsci\/math\/wells\/pub\/ttt.html","DOI":"10.1007\/978-1-4899-0021-0"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Bonsangue, M., Hansen, H., Panangaden, P., Rutten, J., Silva, A.: Algebra-coalgebra duality in Brzozowski\u2019s minimization algorithm. In: ACM Transactions on Computational Logic (TOCL) (2014)","DOI":"10.1145\/2490818"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Bonsangue, M.M., Rutten, J.J.M.M., Silva, A.: Brzozowski\u2019s Algorithm (Co)Algebraically. In: Constable, R.L., Silva, A. (eds.) Kozen Festschrift. LNCS, vol.\u00a07230, pp. 12\u201323. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-29485-3_2"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-03542-0_1","volume-title":"Programming Languages and Systems","author":"F. Bonchi","year":"2013","unstructured":"Bonchi, F., Caltais, G., Pous, D., Silva, A.: Brzozowski\u2019s and up-to algorithms for must testing. In: Shan, C.-C. (ed.) APLAS 2013. LNCS, vol.\u00a08301, pp. 1\u201316. Springer, Heidelberg (2013)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Pous, D.: Checking nfa equivalence with bisimulations up to congruence. In: Giacobazzi, R., Cousot, R. (eds.) POPL, pp. 457\u2013468. ACM (2013)","DOI":"10.1145\/2429069.2429124"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-642-04081-8_12","volume-title":"CONCUR 2009 - Concurrency Theory","author":"M. Boreale","year":"2009","unstructured":"Boreale, M.: Weighted bisimulation in linear algebraic form. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 163\u2013177. Springer, Heidelberg (2009)"},{"key":"20_CR13","unstructured":"Eilenberg, S.: Automata, languages, and machines. Pure and Applied Mathematics. Elsevier Science (1974)"},{"key":"20_CR14","unstructured":"Hopcroft, J.E., Karp, R.M.: A linear algorithm for testing equivalence of finite automata. Technical report, Cornell University (1979)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. Technical report, Stanford University, Stanford, CA, USA (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"issue":"3","key":"20_CR16","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1109\/TAC.1959.1104873","volume":"4","author":"R. Kalman","year":"1959","unstructured":"Kalman, R.: On the general theory of control systems. IRE Transactions on Automatic Control\u00a04(3), 110\u2013110 (1959)","journal-title":"IRE Transactions on Automatic Control"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Pous, D., Sangiorgi, D.: Enhancements of the coinductive proof method. In: Sangiorgi, D., Rutten, J. (eds.) Advanced Topics in Bisimulation and Coinduction. Cambridge Tracts in Theoretical Computer Science, vol.\u00a052, Cambridge University Press (November 2011)","DOI":"10.1017\/CBO9780511792588.007"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-642-35843-2_32","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"J. Rot","year":"2013","unstructured":"Rot, J., Bonsangue, M., Rutten, J.M.M.: Coalgebraic bisimulation-up-to. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol.\u00a07741, pp. 369\u2013381. Springer, Heidelberg (2013)"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/BFb0055624","volume-title":"CONCUR \u201998 Concurrency Theory","author":"J.J.M.M. Rutten","year":"1998","unstructured":"Rutten, J.J.M.M.: Automata and coinduction (an exercise in coalgebra). In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 194\u2013218. Springer, Heidelberg (1998)"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/11804192_8","volume-title":"Formal Methods for Components and Objects","author":"D. Sangiorgi","year":"2006","unstructured":"Sangiorgi, D.: Beyond Bisimulation: The \u201cup-to\u201d Techniques. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol.\u00a04111, pp. 161\u2013171. Springer, Heidelberg (2006)"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-05089-3_14","volume-title":"FM 2009: Formal Methods","author":"M. Shahbaz","year":"2009","unstructured":"Shahbaz, M., Groz, R.: Inferring Mealy Machines. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol.\u00a05850, pp. 207\u2013222. Springer, Heidelberg (2009)"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11817963_5","volume-title":"Computer Aided Verification","author":"M. Wulf De","year":"2006","unstructured":"De Wulf, M., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Antichains: A new algorithm for checking universality of finite automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 17\u201330. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Horizons of the Mind. A Tribute to Prakash Panangaden"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06880-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T15:29:11Z","timestamp":1565450951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06880-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319068794","9783319068800"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06880-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}