{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:23Z","timestamp":1725558923160},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540252610"},{"type":"electronic","value":"9783540318347"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31834-7_26","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T18:23:40Z","timestamp":1278095020000},"page":"316-327","source":"Crossref","is-referenced-by-count":0,"title":["On the Minimal Automaton of the Shuffle of Words and Araucarias"],"prefix":"10.1007","author":[{"given":"Ren\u00e9","family":"Schott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Claude","family":"Spehner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Allauzen, C.: Calcul efficace du shuffle de k mots, Pr\u00e9publication de l\u2019Institut Gaspard Monge, 36 (2000)"},{"key":"26_CR2","unstructured":"Berstel, J., Boasson, L.: Shuffle factorization is unique, Pr\u00e9publication de l\u2019Institut Gaspard Monge, 16 (1999)"},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1985190100211","volume":"19","author":"R. Cori","year":"1985","unstructured":"Cori, R., Perrin, D.: Automates et commutations partielles. RAIRO Inf. Theor.\u00a019, 21\u201332 (1985)","journal-title":"RAIRO Inf. Theor."},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-53031-2","volume-title":"Combinatorics of traces","author":"V. Diekert","year":"1990","unstructured":"Diekert, V.: Combinatorics on Traces. LNCS, vol.\u00a0454. Springer, Heidelberg (1990)"},{"key":"26_CR5","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines. Academic Press, London (1974)"},{"issue":"3","key":"26_CR6","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1051\/ita\/1986200302751","volume":"20","author":"J. Fran\u00e7on","year":"1986","unstructured":"Fran\u00e7on, J.: Une approche quantitative de l\u2019exclusion mutuelle. Theoretical Informatics and Applications\u00a020(3), 275\u2013289 (1986)","journal-title":"Theoretical Informatics and Applications"},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/3-540-45007-6_4","volume-title":"Developments in Language Theory","author":"A.C. G\u00f3mez","year":"2003","unstructured":"G\u00f3mez, A.C., Pin, J.-E.: On a conjecture of Schnoebelen. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 35\u201354. Springer, Heidelberg (2003)"},{"key":"26_CR8","volume-title":"Combinatorics on words","author":"M. Lothaire","year":"1982","unstructured":"Lothaire, M.: Combinatorics on words. Addison-Wesley, Reading (1982)"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/BFb0028557","volume-title":"STACS 1998","author":"A. Mateescu","year":"1998","unstructured":"Mateescu, A.: Shuffle of \u03c9-words: algebraic aspects. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 150\u2013160. Springer, Heidelberg (1998)"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1142\/S0129626494000429","volume":"4","author":"M. Nivat","year":"1994","unstructured":"Nivat, M., Ramkumar, G.D.S., Pandu Rangan, C., Saoudi, A., Sundaram, R.: Efficient parallel shuffle recognition. Parallel Processing Letters\u00a04, 455\u2013463 (1994)","journal-title":"Parallel Processing Letters"},{"key":"26_CR11","first-page":"283","volume":"67","author":"P. Schnoebelen","year":"1999","unstructured":"Schnoebelen, P.: Decomposable regular languages and the shuffle operator. EATCS Bull\u00a067, 283\u2013289 (1999)","journal-title":"EATCS Bull"},{"issue":"1","key":"26_CR12","first-page":"1110","volume":"2","author":"R. Schott","year":"1996","unstructured":"Schott, R., Spehner, J.-C.: Efficient generation of commutation classes. Journal of Computing and Information\u00a02(1), 1110\u20131132 (1996) Special issue: Proceedings of Eighth International Conference of Computing and Information (ICCI 1996), Waterloo, Canada, June 19-22 (1996)","journal-title":"Journal of Computing and Information"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.tcs.2004.03.048","volume":"324","author":"R. Schott","year":"2004","unstructured":"Schott, R., Spehner, J.-C.: Two optimal parallel algorithms on the commutation class of a word. Theoretical Computer Science\u00a0324, 107\u2013131 (2004)","journal-title":"Theoretical Computer Science"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(86)90145-3","volume":"47","author":"J.-C. Spehner","year":"1986","unstructured":"Spehner, J.-C.: Le calcul rapide des m\u00e9langes de deux mots. Theoretical Computer Science\u00a047, 181\u2013203 (1986)","journal-title":"Theoretical Computer Science"},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on finite asynchronous automata and trace languages. RAIRO Inf. Theor.\u00a021, 99\u2013135 (1987)","journal-title":"RAIRO Inf. Theor."}],"container-title":["Lecture Notes in Computer Science","Machines, Computations, and Universality"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31834-7_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:41:38Z","timestamp":1620013298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31834-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540252610","9783540318347"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31834-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}