{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:18:42Z","timestamp":1742912322136,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031055775"},{"type":"electronic","value":"9783031055782"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-05578-2_16","type":"book-chapter","created":{"date-parts":[[2022,5,8]],"date-time":"2022-05-08T17:06:22Z","timestamp":1652029582000},"page":"201-212","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Well Quasi-Orders Arising from\u00a0Finite Ordered Semigroups"],"prefix":"10.1007","author":[{"given":"Ond\u0159ej","family":"Kl\u00edma","sequence":"first","affiliation":[]},{"given":"Jonatan","family":"Kolegar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,6]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(85)90162-8","volume":"40","author":"W Bucher","year":"1985","unstructured":"Bucher, W., Ehrenfeucht, A., Haussler, D.: On total regulators generated by derivation relations. Theor. Comput. Sci. 40, 131\u2013148 (1985). https:\/\/doi.org\/10.1016\/0304-3975(85)90162-8","journal-title":"Theor. Comput. Sci."},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-85780-8_6","volume-title":"Developments in Language Theory","author":"F D\u2019Alessandro","year":"2008","unstructured":"D\u2019Alessandro, F., Varricchio, S.: Well quasi-orders in formal language theory. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 84\u201395. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85780-8_6"},{"key":"16_CR3","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. Theor. Comput. Sci. 27, 311\u2013332 (1983). https:\/\/doi.org\/10.1016\/0304-3975(82)90124-4","journal-title":"Theor. Comput. Sci."},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Haase, C., Schmitz, S., Schnoebelen, P.: The power of priority channel systems. Log. Methods Comput. Sci. 10(4) (2014). https:\/\/doi.org\/10.2168\/LMCS-10(4:4)2014","DOI":"10.2168\/LMCS-10(4:4)2014"},{"key":"16_CR5","doi-asserted-by":"publisher","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. s3-2(1), 326\u2013336 (1952). https:\/\/doi.org\/10.1112\/plms\/s3-2.1.326","DOI":"10.1112\/plms\/s3-2.1.326"},{"key":"16_CR6","volume-title":"An Introduction to Semigroup Theory","author":"JM Howie","year":"1976","unstructured":"Howie, J.M.: An Introduction to Semigroup Theory. Academic Press, London (1976)"},{"key":"16_CR7","unstructured":"Kl\u00edma, O., Kolegar, J.: Well quasi-orders arising from finite ordered semigroups (2022). https:\/\/arxiv.org\/abs\/2203.06535"},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0097-3165(72)90063-5","volume":"13","author":"JB Kruskal","year":"1972","unstructured":"Kruskal, J.B.: The theory of well-quasi-ordering: a frequently discovered concept. J. Comb. Theory Ser. A 13(3), 297\u2013305 (1972). https:\/\/doi.org\/10.1016\/0097-3165(72)90063-5","journal-title":"J. Comb. Theory Ser. A"},{"key":"16_CR9","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. Theor. Comput. Sci. 348, 277\u2013293 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.09.018","journal-title":"Theor. Comput. Sci."},{"key":"16_CR10","doi-asserted-by":"publisher","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., Varricchi, S.: Finiteness and Regularity in Semigroups and Formal Languages. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-59849-4"},{"key":"16_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of Formal Languages. Foundations of Computer Science","author":"J\u00c9 Pin","year":"1986","unstructured":"Pin, J.\u00c9.: Varieties of Formal Languages. Foundations of Computer Science. North Oxford Academic, London (1986)"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/978-3-642-59136-5_10","volume-title":"Handbook of Formal Languages","author":"J-E Pin","year":"1997","unstructured":"Pin, J.-E.: Syntactic semigroups. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 679\u2013746. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59136-5_10"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-030-40608-0_5","volume-title":"Language and Automata Theory and Applications","author":"J\u00c9 Pin","year":"2020","unstructured":"Pin, J.\u00c9.: How to prove that a language is regular or star-free? In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2020. LNCS, vol. 12038, pp. 68\u201388. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40608-0_5"},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02007558","volume":"25","author":"K Sch\u00fctte","year":"1985","unstructured":"Sch\u00fctte, K., Simpson, S.G.: Ein in der reinen Zahlentheorie unbeweisbarer Satz \u00fcber endliche Folgen von nat\u00fcrlichen Zahlen. Arch. Math. Log. 25(1), 75\u201389 (1985). https:\/\/doi.org\/10.1007\/BF02007558","journal-title":"Arch. Math. Log."}],"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-031-05578-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,8]],"date-time":"2022-05-08T17:07:29Z","timestamp":1652029649000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-05578-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031055775","9783031055782"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-05578-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tampa, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.usf.edu\/arts-sciences\/conferences\/dlt2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}