{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:00:24Z","timestamp":1742954424155,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319986531"},{"type":"electronic","value":"9783319986548"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-98654-8_19","type":"book-chapter","created":{"date-parts":[[2018,8,4]],"date-time":"2018-08-04T19:43:57Z","timestamp":1533411837000},"page":"231-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Counting Subwords and Regular Languages"],"prefix":"10.1007","author":[{"given":"Charles J.","family":"Colbourn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan E.","family":"Dougherty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas F.","family":"Lidbetter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,5]]},"reference":[{"key":"19_CR1","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"19_CR2","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.M.: Periodicity and unbordered segments of words. Discret. Math. 26, 101\u2013109 (1979)","journal-title":"Discret. Math."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ipl.2016.09.011","volume":"118","author":"G Gamard","year":"2017","unstructured":"Gamard, G., Richomme, G., Shallit, J., Smith, T.J.: Periodicity in rectangular arrays. Inf. Process. Lett. 118, 58\u201363 (2017)","journal-title":"Inf. Process. Lett."},{"key":"19_CR4","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Boston (1979)"},{"key":"19_CR5","volume-title":"Combinatorics on Words, Encyclopedia of Mathematics and Its Applications","author":"M Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words, Encyclopedia of Mathematics and Its Applications, vol. 17. Addison-Wesley, Boston (1983)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"RC Lyndon","year":"1962","unstructured":"Lyndon, R.C., Sch\u00fctzenberger, M.P.: The equation \n                    \n                      \n                    \n                    $$a^M = b^N c^P$$\n                   in a free group. Mich. Math. J. 9, 289\u2013298 (1962)","journal-title":"Mich. Math. J."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"RJ Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. J. ACM 13, 570\u2013581 (1966)","journal-title":"J. ACM"},{"key":"19_CR8","first-page":"131","volume":"55","author":"A Ralston","year":"1982","unstructured":"Ralston, A.: De Bruijn sequences\u2014a model example of the interaction of discrete mathematics and computer science. Math. Mag. 55, 131\u2013143 (1982)","journal-title":"Math. Mag."},{"key":"19_CR9","volume-title":"A Second Course in Formal Languages and Automata Theory","author":"J Shallit","year":"2009","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press, Cambridge (2009)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98654-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T19:12:23Z","timestamp":1535915543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98654-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98654-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}