{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:14:10Z","timestamp":1742922850814,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_6","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"84-95","source":"Crossref","is-referenced-by-count":5,"title":["Well Quasi-orders in Formal Language Theory"],"prefix":"10.1007","author":[{"given":"Flavio","family":"D\u2019Alessandro","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Varricchio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(92)90050-6","volume":"44","author":"D.P. Bovet","year":"1992","unstructured":"Bovet, D.P., Varricchio, S.: On the regularity of languages on a binary alphabet generated by copying systems. Information Processing Letters\u00a044, 119\u2013123 (1992)","journal-title":"Information Processing Letters"},{"key":"6_CR2","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":"6_CR3","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":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/978-3-540-30550-7_12","volume-title":"Developments in Language Theory","author":"F. D\u2019Alessandro","year":"2004","unstructured":"D\u2019Alessandro, F., Varricchio, S.: Avoidable sets and well quasi orders. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 139\u2013150. Springer, Heidelberg (2004)"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1051\/ita:2006019","volume":"40","author":"F. D\u2019Alessandro","year":"2006","unstructured":"D\u2019Alessandro, F., Varricchio, S.: Well quasi-orders, unavoidable sets, and derivation systems. RAIRO Theoretical Informatics and Applications\u00a040, 407\u2013426 (2006)","journal-title":"RAIRO Theoretical Informatics and Applications"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/11779148_24","volume-title":"Developments in Language Theory","author":"F. D\u2019Alessandro","year":"2006","unstructured":"D\u2019Alessandro, F., Richomme, G., Varricchio, S.: Well quasi orders and the shuffle closure of finite sets. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 260\u2013269. Springer, Heidelberg (2006)"},{"issue":"1\u20133","key":"6_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2007.02.007","volume":"377","author":"F. D\u2019Alessandro","year":"2007","unstructured":"D\u2019Alessandro, F., Richomme, G., Varricchio, S.: Well quasi-orders and context-free grammars. Theoretical Computer Science\u00a0377(1\u20133), 73\u201392 (2007)","journal-title":"Theoretical Computer Science"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/BFb0023841","volume-title":"LATIN \u201992","author":"A. de Luca","year":"1992","unstructured":"de Luca, A., Varricchio, S.: Some regularity conditions based on well quasi-orders. In: Simon, I. (ed.) LATIN 1992. LNCS, vol.\u00a0583, pp. 356\u2013371. Springer, Heidelberg (1992)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/BF01213206","volume":"31","author":"A. de Luca","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":"6_CR10","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. de Luca","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":"6_CR11","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":"6_CR12","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 well quasi orders of words and the confluence property. Theoretical Computer Science\u00a0200, 205\u2013224 (1998)","journal-title":"Theoretical Computer Science"},{"key":"6_CR13","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\n                           *. Discrete Mathematics\u00a057, 237\u2013243 (1985)","journal-title":"Discrete Mathematics"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0166-218X(84)90129-X","volume":"8","author":"A. Ehrenfeucht","year":"1984","unstructured":"Ehrenfeucht, A., Rozenberg, G.: On regularity of languages generated by copying systems. Discrete Applied Mathematics\u00a08, 313\u2013317 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR15","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":"6_CR16","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":"6_CR17","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":"6_CR18","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":"6_CR19","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":"6_CR20","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":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/978-3-540-31856-9_47","volume-title":"STACS 2005","author":"M. Kunc","year":"2005","unstructured":"Kunc, M.: The power of commuting with finite sets of words. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 569\u2013580. Springer, Heidelberg (2005)"},{"issue":"2-3","key":"6_CR22","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.tcs.2005.09.018","volume":"348","author":"M. Kunc","year":"2005","unstructured":"Kunc, M.: Regular solutions of language inequalities and well quasi-orders. Theoretical Computer Science\u00a0348(2-3), 277\u2013293 (2005)","journal-title":"Theoretical Computer Science"},{"key":"6_CR23","volume-title":"Encyclopedia of Mathematics and its applications","author":"Lothaire","year":"2002","unstructured":"Lothaire: Algebraic combinatorics on words. In: Encyclopedia of Mathematics and its applications. Cambridge University Press, Cambridge (2002)"},{"issue":"4","key":"6_CR24","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."},{"key":"6_CR25","unstructured":"Sakarovitch, J.: \u00c9l\u00e9ments de th\u00e9orie des automates, Vuibert, Paris (2003)"},{"issue":"3","key":"6_CR26","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s002360050045","volume":"33","author":"G. Senizergues","year":"1996","unstructured":"Senizergues, G.: On the rational subsets of the free group. Acta Informatica\u00a033(3), 281\u2013296 (1996)","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T00:23:51Z","timestamp":1676679831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}