{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T20:03:45Z","timestamp":1726085025848},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030485153"},{"type":"electronic","value":"9783030485160"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-48516-0_7","type":"book-chapter","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T23:04:30Z","timestamp":1590447870000},"page":"83-95","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The State Complexity of Lexicographically Smallest Words and Computing Successors"],"prefix":"10.1007","author":[{"given":"Lukas","family":"Fleischer","sequence":"first","affiliation":[]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,26]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-02882-3_19","volume-title":"Computing and Combinatorics","author":"M Ackerman","year":"2009","unstructured":"Ackerman, M., M\u00e4kinen, E.: Three new algorithms for regular language enumeration. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol. 5609, pp. 178\u2013191. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02882-3_19"},{"issue":"37","key":"7_CR2","doi-asserted-by":"publisher","first-page":"3461","DOI":"10.1016\/j.tcs.2009.03.018","volume":"410","author":"M Ackerman","year":"2009","unstructured":"Ackerman, M., Shallit, J.: Efficient enumeration of words in regular languages. Theoret. Comput. Sci. 410(37), 3461\u20133470 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1051\/ita\/2010003","volume":"44","author":"P-Y Angrand","year":"2010","unstructured":"Angrand, P.-Y., Sakarovitch, J.: Radix enumeration of rational languages. RAIRO - Theoret. Inform. Appl. 44(1), 19\u201336 (2010)","journal-title":"RAIRO - Theoret. Inform. Appl."},{"key":"7_CR4","volume-title":"Algorithmic Number Theory","author":"E Bach","year":"1996","unstructured":"Bach, E., Shallit, J.: Algorithmic Number Theory. MIT Press, Cambridge (1996)"},{"key":"7_CR5","unstructured":"Berth\u00e9, V., Frougny, C., Rigo, M., Sakarovitch, J.: On the cost and complexity of the successor function. In: Arnoux, P., B\u00e9daride, N., Cassaigne, J. (eds.) Proceedings of WORDS 2007, Technical Report, Institut de math\u00e9matiques de Luminy, pp. 43\u201356 (2007)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci. 47, 149\u2013158 (1986). Erratum, 302:497\u2013498, 2003","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1006\/inco.1997.2650","volume":"139","author":"C Frougny","year":"1997","unstructured":"Frougny, C.: On the sequentiality of the successor function. Inf. Comput. 139(1), 17\u201338 (1997)","journal-title":"Inf. Comput."},{"key":"7_CR8","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2006","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley Longman Publishing Co., Inc., New York (2006)","edition":"3"},{"issue":"1","key":"7_CR9","first-page":"55","volume":"13","author":"E M\u00e4kinen","year":"1997","unstructured":"M\u00e4kinen, E.: On lexicographic enumeration of regular and context-free languages. Acta Cybern. 13(1), 55\u201361 (1997)","journal-title":"Acta Cybern."},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1515\/156939203322694745","volume":"13","author":"AS Okhotin","year":"2003","unstructured":"Okhotin, A.S.: On the complexity of the string generation problem. Discret. Math. Appl. 13, 467\u2013482 (2003)","journal-title":"Discret. Math. Appl."},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1051\/ita\/1983170100231","volume":"17","author":"J Sakarovitch","year":"1983","unstructured":"Sakarovitch, J.: Deux remarques sur un th\u00e9or\u00e8me de S. Eilenberg. RAIRO - Theoret. Inform. Appl. 17(1), 23\u201348 (1983)","journal-title":"RAIRO - Theoret. Inform. Appl."},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1006\/inco.1994.1076","volume":"113","author":"J Shallit","year":"1994","unstructured":"Shallit, J.: Numeration systems, linear recurrences, and regular sets. Inf. Comput. 113(2), 331\u2013347 (1994)","journal-title":"Inf. Comput."},{"key":"7_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808876","volume-title":"A Second Course in Formal Languages and Automata Theory","author":"J Shallit","year":"2008","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press, Cambridge (2008)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48516-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:02:58Z","timestamp":1590451378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48516-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030485153","9783030485160"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48516-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"26 May 2020","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/knot.math.usf.edu\/dlt2020\/","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":"38","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":"24","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":"63% - 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.7","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":"1.48","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":"Conference cancelled due to the COVID-19 pandemic","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}