{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:03:52Z","timestamp":1725455032987},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642334740"},{"type":"electronic","value":"9783642334757"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33475-7_14","type":"book-chapter","created":{"date-parts":[[2012,9,8]],"date-time":"2012-09-08T06:43:09Z","timestamp":1347086589000},"page":"193-208","source":"Crossref","is-referenced-by-count":2,"title":["A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Kurz","sequence":"first","affiliation":[]},{"given":"Tomoyuki","family":"Suzuki","sequence":"additional","affiliation":[]},{"given":"Emilio","family":"Tuosto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM\u00a056(3) (2009)","DOI":"10.1145\/1516512.1516518"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.entcs.2009.06.013","volume":"242","author":"M. Bartoletti","year":"2009","unstructured":"Bartoletti, M., Degano, P., Ferrari, G.L., Zunino, R.: Hard life with weak binders. Electr. Notes Theor. Comput. Sci.\u00a0242(1), 49\u201372 (2009)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M.: Data monoids. In: STACS, pp. 105\u2013116 (2011)","DOI":"10.1145\/2430532.2364520"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Bojanczyk, M., Klin, B., Lasota, S.: Automata with group actions. In: IEEE Symposium on Logic in Computer Science, pp. 355\u2013364 (2011)","DOI":"10.1109\/LICS.2011.48"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0890-5401(03)00038-5","volume":"182","author":"P. Bouyer","year":"2003","unstructured":"Bouyer, P., Petit, A., Th\u00e9rien, D.: An algebraic approach to data languages and timed languages. Inf. Comput.\u00a0182(2), 137\u2013162 (2003)","journal-title":"Inf. Comput."},{"key":"14_CR6","unstructured":"Ciancia, V., Tuosto, E.: A novel class of automata for languages on infinite alphabets. Technical Report CS-09-003, Leicester (2009)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Ciancia, V., Venema, Y.: Stream automata are coalgebras. In: 11th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2012 (2012)","DOI":"10.1007\/978-3-642-32784-1_6"},{"key":"14_CR8","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":"M.J. 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.\u00a06604, pp. 365\u2013380. Springer, Heidelberg (2011)"},{"key":"14_CR9","unstructured":"Gabbay, M., Pitts, A.: A new approach to abstract syntax involving binders. In: Symbolic on Logics in Comput Science, pp. 214\u2013224 (1999)"},{"issue":"3","key":"14_CR10","first-page":"301","volume":"69","author":"M. Kaminski","year":"2006","unstructured":"Kaminski, M., Tan, T.: Regular expressions for languages over infinite alphabets. Fundam. Inform.\u00a069(3), 301\u2013318 (2006)","journal-title":"Fundam. Inform."},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"N. Kaminski","year":"1994","unstructured":"Kaminski, N., Francez, M.: Finite-memory automata. TCS\u00a0134(2), 329\u2013363 (1994)","journal-title":"TCS"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/343369.343378","volume":"1","author":"D. Kozen","year":"2000","unstructured":"Kozen, D.: On Hoare logic and Kleene algebra with tests. ACM Trans. Comput. Log.\u00a01(1), 60\u201376 (2000)","journal-title":"ACM Trans. Comput. Log."},{"key":"14_CR13","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.\u00a07213, pp. 255\u2013269. Springer, Heidelberg (2012)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/3-540-44612-5_52","volume-title":"Mathematical Foundations of Computer Science 2000","author":"U. Montanari","year":"2000","unstructured":"Montanari, U., Pistore, M.: \u03c0-Calculus, Structured Coalgebras and Minimal HD-Automata. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 569\u2013578. Springer, Heidelberg (2000)"},{"key":"14_CR15","unstructured":"Myers, R.: Rational Coalgebraic Machines in Varieties: Languages, Completeness and Automatic Proofs. PhD thesis, Imperial College London (2011)"},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F. Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic\u00a05(3), 403\u2013435 (2004)","journal-title":"ACM Trans. Comput. Logic"},{"key":"14_CR17","unstructured":"Pistore, M.: History Dependent Automata. PhD thesis, Dipartimento di Informatica, Universit\u00e0 di Pisa (1999)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Pouillard, N., Pottier, F.: A fresh look at programming with names and binders. In: Proceeding of the 15th ACM SIGPLAN International Conference on Functional Programming, pp. 217\u2013228 (2010)","DOI":"10.1145\/1863543.1863575"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11874683_3","volume-title":"Computer Science Logic","author":"L. Segoufin","year":"2006","unstructured":"Segoufin, L.: Automata and Logics for Words and Trees over an Infinite Alphabet. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 41\u201357. Springer, Heidelberg (2006)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Shinwell, M., Pitts, A., Gabbay, M.: Freshml: programming with binders made simple. In: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, pp. 263\u2013274 (2003)","DOI":"10.1145\/944746.944729"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-00596-1_8","volume-title":"Foundations of Software Science and Computational Structures","author":"C. Stirling","year":"2009","unstructured":"Stirling, C.: Dependency Tree Automata. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 92\u2013106. Springer, Heidelberg (2009)"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Tzevelekos, N.: Fresh-Register Automata. In: Symposium on Principles of Programming Languages, pp. 295\u2013306. ACM (2011)","DOI":"10.1145\/1925844.1926420"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33475-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T16:49:47Z","timestamp":1687711787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33475-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334740","9783642334757"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33475-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}