{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:35:28Z","timestamp":1770280528264,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662476659","type":"print"},{"value":"9783662476666","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_23","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"286-298","source":"Crossref","is-referenced-by-count":14,"title":["Nominal Kleene Coalgebra"],"prefix":"10.1007","author":[{"given":"Dexter","family":"Kozen","sequence":"first","affiliation":[]},{"given":"Konstantinos","family":"Mamouras","sequence":"additional","affiliation":[]},{"given":"Daniela","family":"Petri\u015fan","sequence":"additional","affiliation":[]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"12","key":"23_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(01)00240-7","volume":"294","author":"J Ad\u00e1mek","year":"2003","unstructured":"Ad\u00e1mek, J.: On final coalgebras of continuous functors. TCS 294(12), 3\u201329 (2003)","journal-title":"TCS"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/11821069_10","volume-title":"Mathematical Foundations of Computer Science 2006","author":"C Allauzen","year":"2006","unstructured":"Allauzen, C., Mohri, M.: A unified construction of the glushkov, follow, and antimirov automata. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 110\u2013121. Springer, Heidelberg (2006)"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. LMCS 10(3) (2014)","DOI":"10.2168\/LMCS-10(3:4)2014"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: POPL 2013, pp. 457\u2013468 (2013)","DOI":"10.1145\/2480359.2429124"},{"issue":"1:16","key":"23_CR5","first-page":"1","volume":"8","author":"T Braibant","year":"2012","unstructured":"Braibant, T., Pous, D.: Deciding Kleene algebras in Coq. LMCS 8(1:16), 1\u201342 (2012)","journal-title":"LMCS"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11548133_10","volume-title":"Algebra and Coalgebra in Computer Science","author":"G-L Ferrari","year":"2005","unstructured":"Ferrari, G.-L., Montanari, U., Tuosto, E., Victor, B., Yemane, K.: Modelling fusion calculus using HD-automata. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 142\u2013156. Springer, Heidelberg (2005)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Foster, N., Kozen, D., Milano, M., Silva, A., Thompson, L.: A coalgebraic decision procedure for NetKAT. In: POPL 2015, pp. 343\u2013355 (2015)","DOI":"10.1145\/2775051.2677011"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"N Francez","year":"1994","unstructured":"Francez, N., Kaminski, M.: Finite-memory automata. TCS 134(2), 329\u2013363 (1994)","journal-title":"TCS"},{"issue":"1\u20133","key":"23_CR9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0304-3975(03)00246-9","volume":"306","author":"N Francez","year":"2003","unstructured":"Francez, N., Kaminski, M.: An algebraic characterization of deterministic regular languages over infinite alphabets. TCS 306(1\u20133), 155\u2013175 (2003)","journal-title":"TCS"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Gabbay, M., Pitts, A.M.: A new approach to abstract syntax involving binders. In: LICS 1999, pp. 214\u2013224 (1999)","DOI":"10.1109\/LICS.1999.782617"},{"issue":"2","key":"23_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2178\/bsl\/1305810911","volume":"17","author":"M Gabbay","year":"2011","unstructured":"Gabbay, M.: Foundations of nominal techniques: logic and semantics of variables in abstract syntax. Bull. Symbolic Logic 17(2), 161\u2013229 (2011)","journal-title":"Bull. Symbolic Logic"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-642-19805-2_25","volume-title":"Foundations of Software Science and Computational Structures","author":"MJ Gabbay","year":"2011","unstructured":"Gabbay, M.J., Ciancia, V.: Freshness and name-restriction in sets of traces with names. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 365\u2013380. Springer, Heidelberg (2011)"},{"key":"23_CR13","unstructured":"Gelade, W., Neven, F.: Succinctness of the complement and intersection of regular expressions. In: TACS 2008. Dagstuhl LIPIcs, vol. 1, pp. 325\u2013336 (2008)"},{"key":"23_CR14","unstructured":"Kozen, D.: On the coalgebraic theory of Kleene algebra with tests. Tech. Rep., Cornell, March 2008. http:\/\/hdl.handle.net\/1813\/10173"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Kozen, D., Mamouras, K., Silva, A.: Completeness and incompleteness in nominal Kleene algebra. Tech. Rep., Cornell, November 2014. http:\/\/hdl.handle.net\/1813\/38143","DOI":"10.1007\/978-3-319-24704-5_4"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Kozen, D., Mamouras, K., Petri\u015fan, D., Silva, A.: Nominal Kleene Coalgebra. Tech. Rep., Cornell, February 2015. http:\/\/hdl.handle.net\/1813\/39108","DOI":"10.1007\/978-3-662-47666-6_23"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-33475-7_14","volume-title":"Theoretical Computer Science","author":"A Kurz","year":"2012","unstructured":"Kurz, A., Suzuki, T., Tuosto, E.: A characterisation of languages on infinite alphabets with nominal regular expressions. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol. 7604, pp. 193\u2013208. Springer, Heidelberg (2012)"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-28729-9_17","volume-title":"Foundations of Software Science and Computational Structures","author":"A Kurz","year":"2012","unstructured":"Kurz, A., Suzuki, T., Tuosto, E.: On nominal regular languages with binders. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol. 7213, pp. 255\u2013269. Springer, Heidelberg (2012)"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Montanari, U., Pistore, M.: History dependent automata. Tech. Rep. TR-11-98, Computer Science, Universit\u00e0 di Pisa (1998)","DOI":"10.1016\/S1571-0661(05)80696-6"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11419822_1","volume-title":"Formal Methods for Mobile Computing","author":"U Montanari","year":"2005","unstructured":"Montanari, U., Pistore, M.: History-dependent automata: an introduction. In: Bernardo, M., Bogliolo, A. (eds.) SFM-Moby 2005. LNCS, vol. 3465, pp. 1\u201328. Springer, Heidelberg (2005)"},{"key":"23_CR21","unstructured":"Pistore, M.: History Dependent Automata. PhD thesis, Universit\u00e0 di Pisa (1999)"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Pitts, A.M.: Nominal Sets: Names and Symmetry in Computer Science, Cambridge Tracts in Theoretical Computer Science 57. Cambridge University Press (2013)","DOI":"10.1017\/CBO9781139084673"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Pous, D.: Symbolic algorithms for language equivalence and kleene algebra with tests. In: POPL 2015, pp. 357\u2013368 (2015)","DOI":"10.1145\/2775051.2677007"},{"key":"23_CR24","unstructured":"Silva, A.: Kleene Coalgebra. PhD thesis, Radboud University Nijmegen (2010)"},{"issue":"2","key":"23_CR25","doi-asserted-by":"publisher","first-page":"367","DOI":"10.7561\/SACS.2012.2.367","volume":"22","author":"A Silva","year":"2012","unstructured":"Silva, A.: Position automata for Kleene algebra with tests. Scientific Annals of Computer Science 22(2), 367\u2013394 (2012)","journal-title":"Scientific Annals of Computer Science"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: STOC 1973, pp. 1\u20139 (1973)","DOI":"10.1145\/800125.804029"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:04:00Z","timestamp":1748459040000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}