{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T23:59:07Z","timestamp":1740095947880,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370632"},{"type":"electronic","value":"9783642370649"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37064-9_34","type":"book-chapter","created":{"date-parts":[[2013,3,15]],"date-time":"2013-03-15T04:07:12Z","timestamp":1363320432000},"page":"383-394","source":"Crossref","is-referenced-by-count":1,"title":["Linear-Time Version of Holub\u2019s Algorithm for Morphic Imprimitivity Testing"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Kociumaka","sequence":"first","affiliation":[]},{"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Wale\u0144","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511546853"},{"issue":"2","key":"34_CR2","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0020-0190(79)90135-2","volume":"9","author":"A. Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Finding a homomorphism between two words is NP-complete. Inf. Process. Lett.\u00a09(2), 86\u201388 (1979)","journal-title":"Inf. Process. Lett."},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC), pp. 246\u2013251 (1983)","DOI":"10.1145\/800061.808753"},{"issue":"2","key":"34_CR4","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput.\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"34_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1080\/00207168108803273","volume":"10","author":"T. Head","year":"1981","unstructured":"Head, T.: Fixed languages and the adult languages of OL schemes. International Journal of Computer Mathematics\u00a010(2), 103\u2013107 (1981)","journal-title":"International Journal of Computer Mathematics"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Head, T., Lando, B.: Fixed and stationary \u03c9-words and \u03c9-languages. In: Rozenberg, G., Salomaa, A. (eds.) The Book of L, pp. 147\u2013156. Springer (1986)","DOI":"10.1007\/978-3-642-95486-3_12"},{"key":"34_CR7","unstructured":"Holub, S.: Algorithm for fixed points of morphisms \u2014 visualization, \n                    \n                      http:\/\/www.karlin.mff.cuni.cz\/~holub\/soubory\/Vizual\/stranka2.html"},{"issue":"16","key":"34_CR8","doi-asserted-by":"publisher","first-page":"5069","DOI":"10.1016\/j.disc.2009.03.019","volume":"309","author":"S. Holub","year":"2009","unstructured":"Holub, S.: Polynomial-time algorithm for fixed points of nontrivial morphisms. Discrete Mathematics\u00a0309(16), 5069\u20135076 (2009)","journal-title":"Discrete Mathematics"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-03784-9_30","volume-title":"String Processing and Information Retrieval","author":"L. Ilie","year":"2009","unstructured":"Ilie, L., Tinta, L.: Practical Algorithms for the Longest Common Extension Problem. In: Karlgren, J., Tarhio, J., Hyyr\u00f6, H. (eds.) SPIRE 2009. LNCS, vol.\u00a05721, pp. 302\u2013309. Springer, Heidelberg (2009)"},{"key":"34_CR10","unstructured":"Matocha, V., Holub, S.: Complexity of testing morphic primitivity. CoRR abs\/1207.5690v1 (2012)"},{"issue":"21-23","key":"34_CR11","doi-asserted-by":"publisher","first-page":"2148","DOI":"10.1016\/j.tcs.2009.01.020","volume":"410","author":"D. Reidenbach","year":"2009","unstructured":"Reidenbach, D., Schneider, J.C.: Morphically primitive words. Theor. Comput. Sci.\u00a0410(21-23), 2148\u20132161 (2009), \n                    \n                      http:\/\/dx.doi.org\/10.1016\/j.tcs.2009.01.020","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37064-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T15:12:04Z","timestamp":1557587524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37064-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370632","9783642370649"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37064-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}