{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:48Z","timestamp":1725796608112},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_6","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"61-70","source":"Crossref","is-referenced-by-count":3,"title":["Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words"],"prefix":"10.1007","author":[{"given":"Kayleigh K.","family":"Hyde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bj\u00f8rn","family":"Kjos-Hanssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Fraenkel, A.S., Simpson, R.J.: How many squares must a binary sequence contain? Electron. J. Combin. 2: Research Paper 2, approx., 9 p. (electronic) (1995)","DOI":"10.37236\/1196"},{"key":"6_CR2","unstructured":"Hyde, K.: Nondeterministic finite state complexity. Master\u2019s thesis, University of Hawaii at Manoa, U.S.A. (2013)"},{"key":"6_CR3","unstructured":"Shallit, J., Wang, M.-W.: Automatic complexity of strings. J. Autom. Lang. Comb.\u00a06(4), 537\u2013554 (2001), 2nd Workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, ON, 2000)"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0012-365X(85)90065-2","volume":"54","author":"R.O. Shelton","year":"1985","unstructured":"Shelton, R.O., Soni, R.P.: Chains and fixing blocks in irreducible binary sequences. Discrete Math.\u00a054(1), 93\u201399 (1985)","journal-title":"Discrete Math."},{"key":"6_CR5","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche zeichenreihen. Norske Vid. Skrifter I Mat.-Nat. Kl., Christiania\u00a07, 1\u201322 (1906)","journal-title":"Norske Vid. Skrifter I Mat.-Nat. Kl., Christiania"},{"key":"6_CR6","first-page":"1","volume":"1","author":"A. Thue","year":"1912","unstructured":"Thue, A.: \u00dcber die gegenseitige lage gleicher teile gewisser zeichenreihen. Norske Vid. Skrifter I Mat.-Nat. Kl., Christiania\u00a01, 1\u201367 (1912)","journal-title":"Norske Vid. Skrifter I Mat.-Nat. Kl., Christiania"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,22]],"date-time":"2020-08-22T01:01:58Z","timestamp":1598058118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}