{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:37Z","timestamp":1725543457806},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354284"},{"type":"electronic","value":"9783540354307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779148_24","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T05:55:49Z","timestamp":1150869349000},"page":"260-269","source":"Crossref","is-referenced-by-count":2,"title":["Well Quasi Orders and the Shuffle Closure of Finite Sets"],"prefix":"10.1007","author":[{"given":"Flavio","family":"D\u2019Alessandro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gw\u00e9na\u00ebl","family":"Richomme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Varricchio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-45007-6_18","volume-title":"Developments in Language Theory","author":"F. D\u2019Alessandro","year":"2003","unstructured":"D\u2019Alessandro, F., Varricchio, S.: On Well Quasi-orders On Languages. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 230\u2013241. Springer, Heidelberg (2003)"},{"issue":"3","key":"24_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.tcs.2004.03.069","volume":"327","author":"F. D\u2019Alessandro","year":"2004","unstructured":"D\u2019Alessandro, F., Varricchio, S.: Well quasi-orders and context-free grammars. Theoretical Computer Science\u00a0327(3), 255\u2013268 (2004)","journal-title":"Theoretical Computer Science"},{"key":"24_CR3","unstructured":"D\u2019Alessandro, F., Varricchio, S.: Well quasi-orders, unavoidable sets, and derivation systems. RAIRO Theoretical Informatics and Applications (to appear)"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/BF01213206","volume":"31","author":"A. Luca de","year":"1994","unstructured":"de Luca, A., Varricchio, S.: Well quasi-orders and regular languages. Acta Informatica\u00a031, 539\u2013557 (1994)","journal-title":"Acta Informatica"},{"key":"24_CR5","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59849-4","volume-title":"Finiteness and regularity in semigroups and formal languages","author":"A. Luca de","year":"1999","unstructured":"de Luca, A., Varricchio, S.: Finiteness and regularity in semigroups and formal languages. EATCS Monographs on Theoretical Computer Science. Springer, Berlin (1999)"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(82)90124-4","volume":"27","author":"A. Ehrenfeucht","year":"1983","unstructured":"Ehrenfeucht, A., Haussler, D., Rozenberg, G.: On regularity of context-free languages. Theoretical Computer Science\u00a027, 311\u2013332 (1983)","journal-title":"Theoretical Computer Science"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0304-3975(97)00259-4","volume":"200","author":"T. Harju","year":"1998","unstructured":"Harju, T., Ilie, L.: On quasi orders of words and the confluence property. Theoretical Computer Science\u00a0200, 205\u2013224 (1998)","journal-title":"Theoretical Computer Science"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0012-365X(85)90176-1","volume":"57","author":"D. Haussler","year":"1985","unstructured":"Haussler, D.: Another generalization of Higman\u2019s well quasi-order result on \u03a3*. Discrete Mathematics\u00a057, 237\u2013243 (1985)","journal-title":"Discrete Mathematics"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"3","author":"G.H. Higman","year":"1952","unstructured":"Higman, G.H.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc.\u00a03, 326\u2013336 (1952)","journal-title":"Proc. London Math. Soc."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(98)00036-X","volume":"204","author":"L. Ilie","year":"1998","unstructured":"Ilie, L., Salomaa, A.: On well quasi orders of free monoids. Theoretical Computer Science\u00a0204, 131\u2013152 (1998)","journal-title":"Theoretical Computer Science"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1007\/s002360050176","volume":"36","author":"B. Intrigila","year":"2000","unstructured":"Intrigila, B., Varricchio, S.: On the generalization of Higman and Kruskal\u2019s theorems to regular languages and rational trees. Acta Informatica\u00a036, 817\u2013835 (2000)","journal-title":"Acta Informatica"},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0304-3975(99)00277-7","volume":"245","author":"M. Ito","year":"2000","unstructured":"Ito, M., Kari, L., Thierrin, G.: Shuffle and scattered deletion closure of languages. Theoretical Computer Science\u00a0245(1), 115\u2013133 (2000)","journal-title":"Theoretical Computer Science"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(85)90221-X","volume":"38","author":"M. Jantzen","year":"1985","unstructured":"Jantzen, M.: Extending regular expressions with iterated shuffle. Theoretical Computer Science\u00a038, 223\u2013247 (1985)","journal-title":"Theoretical Computer Science"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0097-3165(72)90063-5","volume":"13","author":"J. Kruskal","year":"1972","unstructured":"Kruskal, J.: The theory of well-quasi-ordering: a frequently discovered concept. J. Combin. Theory, Ser. A\u00a013, 297\u2013305 (1972)","journal-title":"J. Combin. Theory, Ser. A"},{"key":"24_CR15","unstructured":"Lothaire: Combinatorics on words. Series Encyclopedia of Mathematics and its Applications, vol.\u00a017. Addison-Wesley, Reading, Mass. (1983)"},{"issue":"4","key":"24_CR16","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0747-7171(89)80035-5","volume":"8","author":"L. Puel","year":"1989","unstructured":"Puel, L.: Using unavoidable sets of trees to generalize Kruskal\u2019s theorem. J. Symbolic Comput.\u00a08(4), 335\u2013382 (1989)","journal-title":"J. Symbolic Comput."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779148_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:49Z","timestamp":1619507749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779148_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354284","9783540354307"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11779148_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}