{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:41:19Z","timestamp":1725745279267},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405785"},{"type":"electronic","value":"9783642405792"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40579-2_12","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T10:24:48Z","timestamp":1376475888000},"page":"95-106","source":"Crossref","is-referenced-by-count":1,"title":["Suffix Conjugates for a Class of Morphic Subshifts"],"prefix":"10.1007","author":[{"given":"James D.","family":"Currie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narad","family":"Rampersad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kalle","family":"Saari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Allouche, J.-P., Shallit, J.: Automatic sequences: Theory, Applications, and Generalizations. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511546563"},{"key":"12_CR2","unstructured":"Cassaigne, J.: An algorithm to test if a given circular HD0L-language avoids a pattern. In: Information Processing 1994, Hamburg. IFIP Trans. A Comput. Sci. Tech., vol.\u00a0I, A-51, pp. 459\u2013464. North-Holland, Amsterdam (1994)"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"353","DOI":"10.5802\/jtnb.327","volume":"13","author":"V. Canterini","year":"2001","unstructured":"Canterini, V., Siegel, A.: Automate des pr\u00e9fixes-suffixes associ\u00e9 \u00e0 une substitution primitive. J. Th\u00e9orie Nombres Bordeaux\u00a013, 353\u2013369 (2001)","journal-title":"J. Th\u00e9orie Nombres Bordeaux"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-38771-5_14","volume-title":"Developments in Language Theory","author":"J.D. Currie","year":"2013","unstructured":"Currie, J.D., Rampersad, N., Saari, K.: Extremal words in the shift orbit closure of a morphic sequence. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol.\u00a07907, pp. 143\u2013154. Springer, Heidelberg (2013), preprint available at \n                    \n                      http:\/\/arxiv.org\/abs\/1301.4972"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s002240000114","volume":"32","author":"C. Holton","year":"1999","unstructured":"Holton, C., Zamboni, L.Q.: Descendants of primitive substitutions. Theory Comput. Systems\u00a032, 133\u2013157 (1999)","journal-title":"Theory Comput. Systems"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s00224-001-1038-y","volume":"34","author":"C. Holton","year":"2001","unstructured":"Holton, C., Zamboni, L.Q.: Directed graphs and substitutions. Theory Comput. Systems\u00a034, 545\u2013564 (2001)","journal-title":"Theory Comput. Systems"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2012.05.007","volume":"445","author":"K. Klouda","year":"2012","unstructured":"Klouda, K.: Bispecial factors in circular non-pushy D0L languages. Theoret. Comput. Sci.\u00a0445, 63\u201374 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR8","unstructured":"K\u016frka, P.: Topological and Symbolic Dynamics. Soci\u00e9t\u00e9 Math\u00e9matique de France, Paris (2003)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Lind, D., Marcus, B.: An introduction to symbolic dynamics and coding. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511626302"},{"key":"12_CR10","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications, vol.\u00a090, Cambridge University Press, Cambridge (2002)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/3-540-56939-1_98","volume-title":"Automata, Languages and Programming","author":"F. Mignosi","year":"1993","unstructured":"Mignosi, F., S\u00e9\u00e9bold, P.: If a D0L language is k-power free then it is circular. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol.\u00a0700, pp. 507\u2013518. Springer, Heidelberg (1993)"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(00)00436-9","volume":"273","author":"F. Mignosi","year":"2002","unstructured":"Mignosi, F., Restivo, A., Sciortino, M.: Words and forbidden factors. Theoret. Comput. Sci.\u00a0273, 99\u2013117 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0304-3975(92)90357-L","volume":"99","author":"B. Moss\u00e9","year":"1992","unstructured":"Moss\u00e9, B.: Puissances de mots et reconnaissabilit\u00e9 des points fixes d\u2019une substitution. Theoret. Comput. Sci.\u00a099, 327\u2013334 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-22321-1_34","volume-title":"Developments in Language Theory","author":"J. Shallit","year":"2011","unstructured":"Shallit, J.: Fife\u2019s theorem revisited. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 397\u2013405. Springer, Heidelberg (2011)"},{"key":"12_CR15","unstructured":"Shur, A.: Combinatorial complexity of rational languages. Discr. Anal. and Oper. Research, Ser. 1 12(2), 78\u201399 (2005) (in Russian)"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40579-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T15:31:46Z","timestamp":1558020706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40579-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405785","9783642405792"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40579-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}