{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:07Z","timestamp":1725488947623},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_66","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"750-761","source":"Crossref","is-referenced-by-count":12,"title":["Shuffle Expressions and Words with Nested Data"],"prefix":"10.1007","author":[{"given":"Henrik","family":"Bj\u00f6rklund","sequence":"first","affiliation":[]},{"given":"Miko\u0142aj","family":"Boja\u0144czyk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"66_CR1","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, H., Schwentick, T.: On notions of regularity for data languages. In: FCT 2007 (to appear, 2007)","DOI":"10.1007\/978-3-540-74240-1_9"},{"key":"66_CR2","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS 2006, pp. 7\u201316 (2006)","DOI":"10.1109\/LICS.2006.51"},{"issue":"2","key":"66_CR3","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. Information and Computation\u00a0182(2), 137\u2013162 (2003)","journal-title":"Information and Computation"},{"key":"66_CR4","doi-asserted-by":"crossref","unstructured":"Demri, S., Lazi\u0107, R.: LTL with the freeze quantifier and register automata. In: LICS 2006, pp. 17\u201326 (2006)","DOI":"10.1109\/LICS.2006.31"},{"issue":"9","key":"66_CR5","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1145\/358746.358767","volume":"24","author":"J. Gischer","year":"1981","unstructured":"Gischer, J.: Shuffle languages, petri nets, and context-sensitive grammars. Communications of the ACM\u00a024(9), 597\u2013605 (1981)","journal-title":"Communications of the ACM"},{"key":"66_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0304-3975(99)00109-7","volume":"250","author":"J. Jedrzejowicz","year":"2001","unstructured":"Jedrzejowicz, J., Szepietowski, A.: Shuffle languages are in P. TCS\u00a0250, 31\u201353 (2001)","journal-title":"TCS"},{"issue":"2","key":"66_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"132","author":"M. Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. TCS\u00a0132(2), 329\u2013363 (1994)","journal-title":"TCS"},{"key":"66_CR8","doi-asserted-by":"crossref","unstructured":"Lomazova, I.A., Schnoebelen, P.: Some decidability results for nested petri nets. In: PSI 1999, pp. 208\u2013220 (2000)","DOI":"10.1007\/3-540-46562-6_18"},{"issue":"3","key":"66_CR9","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"15","author":"F. Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM transactions on computational logic\u00a015(3), 403\u2013435 (2004)","journal-title":"ACM transactions on computational logic"},{"key":"66_CR10","doi-asserted-by":"crossref","unstructured":"Parikh, R.: On context-free languages. Journal of the ACM, 570\u2013581 (1966)","DOI":"10.1145\/321356.321364"},{"key":"66_CR11","doi-asserted-by":"crossref","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)","DOI":"10.1007\/11874683_3"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:29:39Z","timestamp":1619519379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}