{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T22:49:24Z","timestamp":1754261364712,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031826962"},{"type":"electronic","value":"9783031826979"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-82697-9_19","type":"book-chapter","created":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T10:17:59Z","timestamp":1739614679000},"page":"254-268","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Incremental Computation of\u00a0the\u00a0Set of\u00a0Period Sets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3791-3973","authenticated-orcid":false,"given":"Eric","family":"Rivals","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,16]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s12095-013-0088-8","volume":"6","author":"D Bajic","year":"2013","unstructured":"Bajic, D., Loncar-Turukalo, T.: A simple suboptimal construction of cross-bifix-free codes. Cryptogr. Commun. 6(1), 27\u201337 (2013). https:\/\/doi.org\/10.1007\/s12095-013-0088-8","journal-title":"Cryptogr. Commun."},{"issue":"6","key":"19_CR2","doi-asserted-by":"publisher","first-page":"4058","DOI":"10.1109\/TIT.2012.2189479","volume":"58","author":"S Bilotta","year":"2012","unstructured":"Bilotta, S., Pergola, E., Pinzani, R.: A new approach to cross-bifix-free sets. IEEE Trans. Inf. Theory 58(6), 4058\u20134063 (2012). https:\/\/doi.org\/10.1109\/TIT.2012.2189479","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/s0304-3975(98)00251-5","volume":"218","author":"M Castelli","year":"1999","unstructured":"Castelli, M., Mignosi, F., Restivo, A.: Fine and Wilfs theorem for three periods and a generalization of sturmian words. Theoret. Comput. Sci. 218(1), 83\u201394 (1999). https:\/\/doi.org\/10.1016\/s0304-3975(98)00251-5","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0012-365x(79)90116-x","volume":"26","author":"A Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Silberger, D.: Periodicity and unbordered segments of words. Discret. Math. 26(2), 101\u2013109 (1979). https:\/\/doi.org\/10.1016\/0012-365x(79)90116-x","journal-title":"Discret. Math."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"NJ Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Amer. Math. Soc. 16, 109\u2013114 (1965)","journal-title":"Proc. Amer. Math. Soc."},{"issue":"05","key":"19_CR6","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1142\/s0129054121410094","volume":"32","author":"D Gabric","year":"2021","unstructured":"Gabric, D., Rampersad, N., Shallit, J.: An inequality for the number of periods in a word. Int. J. Found. Comput. Sci. 32(05), 597\u2013614 (2021). https:\/\/doi.org\/10.1142\/s0129054121410094","journal-title":"Int. J. Found. Comput. Sci."},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Guibas, L.J., Odlyzko, A.M.: Periods in strings. J. of Combinatorial Theory series A 30, 19\u201342 (1981). https:\/\/doi.org\/10.1016\/0097-3165(81)90038-8","DOI":"10.1016\/0097-3165(81)90038-8"},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"Halava, V., Harju, T., Ilie, L.: Periods and binary words. J. Comb. Theory, Ser. A 89(2), 298\u2013303 (2000). https:\/\/doi.org\/10.1006\/JCTA.1999.3014,","DOI":"10.1006\/JCTA.1999.3014"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Holub, S., Shallit, J.O.: Periods and borders of random words. In: Ollinger, N., Vollmer, H. (eds.) 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orl\u00e9ans, France. LIPIcs, vol.\u00a047, pp. 44:1\u201344:10. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2016.44","DOI":"10.4230\/LIPIcs.STACS.2016.44"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D Knuth","year":"1977","unstructured":"Knuth, D., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM J. Comput. 6, 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-04107-5_32","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods 2008","author":"P Leopardi","year":"2009","unstructured":"Leopardi, P.: Testing the tests: using random number generators to improve empirical tests. In: L\u2019 Ecuyer, P., Owen, A.B. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2008, pp. 501\u2013512. Springer Berlin Heidelberg, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04107-5_32"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Lothaire, M. (ed.): Combinatorics on Words. Cambridge University Press, second edn. (1997)","DOI":"10.1017\/CBO9780511566097"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2005). http:\/\/www-igm.univ-mlv.fr\/~berstel\/Lothaire\/index.html","DOI":"10.1017\/CBO9781107341005"},{"issue":"9","key":"19_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0898-1221(93)90001-C","volume":"26","author":"G Marsaglia","year":"1993","unstructured":"Marsaglia, G., Zaman, A.: Monkey tests for random number generators. Comput. Math. Appl. 26(9), 1\u201310 (1993)","journal-title":"Comput. Math. Appl."},{"key":"19_CR15","doi-asserted-by":"publisher","unstructured":"Nielsen, P.: A note on bifix-free sequences (corresp.). IEEE Trans. Info. Theory 19(5), 704-706 (1973). https:\/\/doi.org\/10.1109\/tit.1973.1055065","DOI":"10.1109\/tit.1973.1055065"},{"key":"19_CR16","doi-asserted-by":"publisher","unstructured":"Nielsen, P.: On the expected duration of a search for a fixed pattern in random data (corresp.). IEEE Trans. Info. Theory 19(5), 702\u2013704 (1973). https:\/\/doi.org\/10.1109\/tit.1973.1055064","DOI":"10.1109\/tit.1973.1055064"},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/210330.210331","volume":"5","author":"OE Percus","year":"1995","unstructured":"Percus, O.E., Whitlock, P.A.: Theory and application of Marsaglia\u2019s monkey test for pseudorandom number generators. ACM Trans. Model. Comput. Simul. 5(2), 87\u2013100 (1995)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/3-540-45123-4_31","volume-title":"Combinatorial Pattern Matching","author":"S Rahmann","year":"2000","unstructured":"Rahmann, S., Rivals, E.: Exact and efficient computation of the expected number of missing and common words in random texts. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 375\u2013387. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45123-4_31"},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Rahmann, S., Rivals, E.: On the distribution of the number of missing words in random texts. Comb. Probab. Comput. 12(01) (2003). https:\/\/doi.org\/10.1017\/s0963548302005473","DOI":"10.1017\/s0963548302005473"},{"key":"19_CR20","doi-asserted-by":"publisher","unstructured":"Rivals, E.: Incremental computation of the set of period sets. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2410.12077, arXiv:2410.12077, 21 pages","DOI":"10.48550\/arXiv.2410.12077"},{"key":"19_CR21","doi-asserted-by":"publisher","unstructured":"Rivals, E.: Sets of period sets for words of length n. Zenodo (2024). https:\/\/doi.org\/10.5281\/zenodo.13826260, data set","DOI":"10.5281\/zenodo.13826260"},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/3-540-48224-5_51","volume-title":"Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8\u201312, 2001 Proceedings","author":"E Rivals","year":"2001","unstructured":"Rivals, E., Rahmann, S.: Combinatorics of Periods in Strings. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8\u201312, 2001 Proceedings, pp. 615\u2013626. Springer Berlin Heidelberg, Berlin, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-48224-5_51"},{"key":"19_CR23","doi-asserted-by":"publisher","unstructured":"Rivals, E., Rahmann, S.: Combinatorics of periods in strings. J. Combinatorial Theory Ser. A 104(1), 95\u2013113 (2003). https:\/\/doi.org\/10.1016\/s0097-3165(03)00123-7","DOI":"10.1016\/s0097-3165(03)00123-7"},{"key":"19_CR24","doi-asserted-by":"publisher","unstructured":"Rivals, E., Sweering, M., Wang, P.: Convergence of the number of period sets in strings. In: Etessami, K., Feige, U., Puppis, G. (eds.) 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0261, pp. 100:1\u2013100:14. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2023.100","DOI":"10.4230\/LIPIcs.ICALP.2023.100"},{"key":"19_CR25","unstructured":"Smyth, W.F.: Computating Pattern in Strings. Pearson - Addison Wesley (2003)"},{"issue":"1","key":"19_CR26","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/s0019-3577(03)90076-0","volume":"14","author":"R Tijdeman","year":"2003","unstructured":"Tijdeman, R., Zamboni, L.: Fine and Wilf words for any periods. Indag. Math. 14(1), 135\u2013147 (2003). https:\/\/doi.org\/10.1016\/s0019-3577(03)90076-0","journal-title":"Indag. Math."},{"issue":"30\u201332","key":"19_CR27","doi-asserted-by":"publisher","first-page":"3027","DOI":"10.1016\/j.tcs.2009.02.004","volume":"410","author":"R Tijdeman","year":"2009","unstructured":"Tijdeman, R., Zamboni, L.: Fine and Wilf words for any periods ii. Theoret. Comput. Sci. 410(30\u201332), 3027\u20133034 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.02.004","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"19_CR28","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E Ukkonen","year":"1992","unstructured":"Ukkonen, E.: Approximate string-matching with $$q$$-grams and maximal matches. Theor. Comp. Sci. 92(1), 191\u2013211 (1992)","journal-title":"Theor. Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2025: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82697-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T10:18:06Z","timestamp":1739614686000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82697-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031826962","9783031826979"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82697-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"16 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sofsem.sk","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}