{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:59:34Z","timestamp":1742961574001,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"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_10","type":"book-chapter","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T23:02:38Z","timestamp":1562540558000},"page":"137-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalized de Bruijn Words and the State Complexity of Conjugate Sets"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Gabric","sequence":"first","affiliation":[]},{"given":"\u0160t\u011bp\u00e1n","family":"Holub","sequence":"additional","affiliation":[]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"10_CR1","first-page":"203","volume":"28","author":"T van Aardenne-Ehrenfest","year":"1951","unstructured":"van Aardenne-Ehrenfest, T., de Bruijn, N.G.: Circuits and trees in oriented linear graphs. Simon Stevin 28, 203\u2013217 (1951)","journal-title":"Simon Stevin"},{"key":"10_CR2","first-page":"39","volume":"13","author":"M Anisiu","year":"2002","unstructured":"Anisiu, M., Bl\u00e1zsik, Z., K\u00e1sa, Z.: Maximal complexity of finite words. Pure Math. Appl. 13, 39\u201348 (2002)","journal-title":"Pure Math. Appl."},{"key":"10_CR3","first-page":"758","volume":"49","author":"NG de Bruijn","year":"1946","unstructured":"de Bruijn, N.G.: A combinatorial problem. Proc. Konin. Neder. Akad. Wet. 49, 758\u2013764 (1946)","journal-title":"Proc. Konin. Neder. Akad. Wet."},{"key":"10_CR4","unstructured":"de Bruijn, N.G.: Acknowledgement of priority to C. Flye Sainte-Marie on the counting of circular arrangements of $$2^n$$ zeros and ones that show each $$n$$-letter word exactly once. Technical report 75-WSK-06, Department of Mathematics and Computing Science, Eindhoven University of Technology, The Netherlands (1975)"},{"issue":"1\/2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.25596\/jalc-2010-071","volume":"15","author":"JA Brzozowski","year":"2010","unstructured":"Brzozowski, J.A.: Quotient complexity of regular languages. J. Autom. Lang. Comb. 15(1\/2), 71\u201389 (2010). https:\/\/doi.org\/10.25596\/jalc-2010-071","journal-title":"J. Autom. Lang. Comb."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0304-3975(86)90118-0","volume":"44","author":"T Etzion","year":"1986","unstructured":"Etzion, T.: An algorithm for generating shift-register cycles. Theoret. Comput. Sci. 44, 209\u2013224 (1986). https:\/\/doi.org\/10.1016\/0304-3975(86)90118-0","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"8","DOI":"10.37236\/1761","volume":"11","author":"A Flaxman","year":"2004","unstructured":"Flaxman, A., Harrow, A.W., Sorkin, G.B.: Strings with maximally many distinct subsequences and substrings. Electron. J. Combin. 11(1), 8 (2004). http:\/\/www.combinatorics.org\/Volume11\/Abstracts\/v11i1r8.html","journal-title":"Electron. J. Combin."},{"key":"10_CR8","first-page":"107","volume":"1","author":"C Flye Sainte-Marie","year":"1894","unstructured":"Flye Sainte-Marie, C.: Question 48. L\u2019Interm\u00e9diaire Math. 1, 107\u2013110 (1894)","journal-title":"L\u2019Interm\u00e9diaire Math."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/1024041","volume":"24","author":"H Fredricksen","year":"1982","unstructured":"Fredricksen, H.: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev. 24, 195\u2013221 (1982). https:\/\/doi.org\/10.1137\/1024041","journal-title":"SIAM Rev."},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1112\/jlms\/s1-21.3.167","volume":"21","author":"IJ Good","year":"1946","unstructured":"Good, I.J.: Normal recurring decimals. J. London Math. Soc. 21, 167\u2013169 (1946)","journal-title":"J. London Math. Soc."},{"issue":"12","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1109\/TC.1978.1675025","volume":"27","author":"F Hemmati","year":"1978","unstructured":"Hemmati, F., Costello Jr., D.J.: An algebraic construction for q-ary shift register sequences. IEEE Trans. Comput. 27(12), 1192\u20131195 (1978). https:\/\/doi.org\/10.1109\/TC.1978.1675025","journal-title":"IEEE Trans. Comput."},{"key":"10_CR12","first-page":"69","volume":"8","author":"A Iv\u00e1nyi","year":"1987","unstructured":"Iv\u00e1nyi, A.: On the $$d$$-complexity of words. Ann. Univ. Sci. Budapest. Sect. Comput. 8, 69\u201390 (1987)","journal-title":"Ann. Univ. Sci. Budapest. Sect. Comput."},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-38536-0_22","volume-title":"Computer Science \u2013 Theory and Applications","author":"J Jir\u00e1sek","year":"2013","unstructured":"Jir\u00e1sek, J., Jir\u00e1skov\u00e1, G.: Cyclic shift on prefix-free languages. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol. 7913, pp. 246\u2013257. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38536-0_22"},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1051\/ita:2007038","volume":"42","author":"G Jir\u00e1skov\u00e1","year":"2008","unstructured":"Jir\u00e1skov\u00e1, G., Okhotin, A.: State complexity of cyclic shift. RAIRO Theor. Inform. Appl. 42(2), 335\u2013360 (2008). https:\/\/doi.org\/10.1051\/ita:2007038","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0097-3165(71)90029-X","volume":"10","author":"A Lempel","year":"1971","unstructured":"Lempel, A.: $$m$$-ary closed sequences. J. Combin. Theory 10, 253\u2013258 (1971)","journal-title":"J. Combin. Theory"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1090\/S0002-9904-1934-05988-3","volume":"40","author":"MH Martin","year":"1934","unstructured":"Martin, M.H.: A problem in arrangements. Bull. Am. Math. Soc. 40, 859\u2013864 (1934)","journal-title":"Bull. Am. Math. Soc."},{"issue":"6","key":"10_CR17","first-page":"1266","volume":"194","author":"AN Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Dokl. Akad. Nauk SSSR 194(6), 1266\u20131268 (1970). In Russian. English translation in Soviet Math. Doklady 11(5), 1373\u20131375 (1970)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.2307\/2690079","volume":"55","author":"A Ralston","year":"1982","unstructured":"Ralston, A.: De Bruijn sequences \u2014 a model example of the interaction of discrete mathematics and computer science. Math. Mag. 55, 131\u2013143 (1982). https:\/\/doi.org\/10.2307\/2690079","journal-title":"Math. Mag."},{"issue":"2\u20134","key":"10_CR19","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BF02988306","volume":"9","author":"J Shallit","year":"1993","unstructured":"Shallit, J.: On the maximum number of distinct factors of a binary string. Graphs Combin. 9(2\u20134), 197\u2013200 (1993). https:\/\/doi.org\/10.1007\/BF02988306","journal-title":"Graphs Combin."},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Sloane, N.J.A. et al.: The on-line encyclopedia of integer sequences (2019). https:\/\/oeis.org","DOI":"10.1515\/9780691197944-009"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T06:50:56Z","timestamp":1739343056000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23247-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030232467","9783030232474"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23247-4_10","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)"}}]}}