{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:30:08Z","timestamp":1742913008520,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030232467"},{"type":"electronic","value":"9783030232474"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23247-4_18","type":"book-chapter","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T23:02:38Z","timestamp":1562540558000},"page":"235-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Classes of Regular Languages Related to Monotone WQOs"],"prefix":"10.1007","author":[{"given":"Mizuhito","family":"Ogawa","sequence":"first","affiliation":[]},{"given":"Victor","family":"Selivanov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"18_CR1","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge (1994)"},{"key":"18_CR2","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)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"18_CR3","doi-asserted-by":"publisher","first-page":"437","DOI":"10.25596\/jalc-2001-437","volume":"6","author":"C Gla\u00dfer","year":"2001","unstructured":"Gla\u00dfer, C., Schmitz, H.: The boolean structure of dot-depth one. J. Autom. Lang. Comb. 6(4), 437\u2013452 (2001). https:\/\/doi.org\/10.25596\/jalc-2001-437","journal-title":"J. Autom. Lang. Comb."},{"issue":"C","key":"18_CR4","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2016.07.017","volume":"646","author":"C Gla\u00dfer","year":"2016","unstructured":"Gla\u00dfer, C., Schmitz, H., Selivanov, V.L.: Efficient algorithms for membership in boolean hierarchies of regular languages. Theor. Comput. Sci. 646(C), 86\u2013108 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.07.017","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"s3\u20132","author":"G Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. s3\u20132(1), 326\u2013336 (1952). https:\/\/doi.org\/10.1112\/plms\/s3-2.1.326","journal-title":"Proc. Lond. Math. Soc."},{"key":"18_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-72905-8_7","volume-title":"Mathematics of Ramsey Theory. Algorithms and Combinatorics","author":"I K\u0159\u00ed\u017e","year":"1990","unstructured":"K\u0159\u00ed\u017e, I., Thomas, R.: Ordinal types in ramsey theory and well-partial-ordering theory. In: Ne\u0161e t\u0159 il, J., R\u00f6dl, V. (eds.) Mathematics of Ramsey Theory. Algorithms and Combinatorics, vol. 5. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/978-3-642-72905-8_7"},{"key":"18_CR7","unstructured":"Laver, R.: Better-quasi-orderings and a class of trees. In: Studies in foundations and combinatorics, Advances in mathematics: Supplementary studies, vol. 1, pp. 31\u201348. Academic Press (1978)"},{"key":"18_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59849-4","volume-title":"Finiteness and Regularity in Semigroups and Formal Languages. Monographs in Theoretical Computer Science","author":"A de Luca","year":"1999","unstructured":"de Luca, A., Varricchio, S.: Finiteness and Regularity in Semigroups and Formal Languages. Monographs in Theoretical Computer Science. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-59849-4"},{"issue":"2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1090\/S0002-9947-1994-1219735-8","volume":"345","author":"A Marcone","year":"1994","unstructured":"Marcone, A.: Foundations of BQO theory. Trans. AMS 345(2), 641\u2013660 (1994)","journal-title":"Trans. AMS"},{"issue":"4","key":"18_CR10","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1023\/A:1013952225669","volume":"18","author":"A Marcone","year":"2001","unstructured":"Marcone, A.: Fine analysis of the quasi-orderings on the power set. Order 18(4), 339\u2013347 (2001). https:\/\/doi.org\/10.1023\/A:1013952225669","journal-title":"Order"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1017\/S0305004100038603","volume":"61","author":"CSJA Nash-Williams","year":"1965","unstructured":"Nash-Williams, C.S.J.A.: On well-quasi-ordering transfinite sequences. Math. Proc. Cambridge Philos. Soc. 61, 33\u201339 (1965)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2004.03.052","volume":"324","author":"M Ogawa","year":"2004","unstructured":"Ogawa, M.: Well-quasi-orders and regular omega-languages. Theor. Comput. Sci. 324(1), 55\u201360 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2004.03.052","journal-title":"Theor. Comput. Sci."},{"key":"18_CR13","unstructured":"Perrin, D., Pin, J.: Infinite Words, Pure and Applied Mathematics, vol. 141 (2004)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BFb0054312","volume-title":"LATIN 1998: Theoretical Informatics","author":"J Pin","year":"1998","unstructured":"Pin, J.: Positive varieties and infinite words. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 76\u201387. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054312"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1112\/S0025579300000565","volume":"1","author":"R Rado","year":"1954","unstructured":"Rado, R.: Partial well-ordering of sets of vectors. Mathematika 1, 89\u201395 (1954)","journal-title":"Mathematika"},{"key":"18_CR16","volume-title":"Theory of recursive functions and effective computability","author":"H Rogers Jr","year":"1967","unstructured":"Rogers Jr., H.: Theory of recursive functions and effective computability. McGraw-Hill, New York (1967)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-44693-1_47","volume-title":"STACS 2001","author":"VL Selivanov","year":"2001","unstructured":"Selivanov, V.L.: A logical approach to decidability of hierarchies of regular star\u2014free languages. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 539\u2013550. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44693-1_47"},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1051\/ita:2007063","volume":"43","author":"VL Selivanov","year":"2009","unstructured":"Selivanov, V.L.: Hierarchies and reducibilities on regular languages related to modulo counting. RAIRO Theor. Inform. Appl. 43(1), 95\u2013132 (2009)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol. B, pp. 133\u2013192. Elsevier Science Publishers (1990)","DOI":"10.1016\/B978-0-444-88074-1.50009-3"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23247-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T06:51:06Z","timestamp":1739343066000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23247-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030232467","9783030232474"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23247-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ko\u0161ice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/im.saske.sk\/dcfs2019\/","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":"25","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":"18","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":"72% - 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,1","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":"2,9","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)"}},{"value":"there are also 4 invited talks","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}