{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:06:29Z","timestamp":1743033989159,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319587400"},{"type":"electronic","value":"9783319587417"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58741-7_10","type":"book-chapter","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T16:59:28Z","timestamp":1494521968000},"page":"98-100","source":"Crossref","is-referenced-by-count":1,"title":["Formulas with Reversal"],"prefix":"10.1007","author":[{"given":"Narad","family":"Rampersad","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0304-3975(89)90071-6","volume":"69","author":"K Baker","year":"1989","unstructured":"Baker, K., McNulty, G., Taylor, W.: Growth problems for avoidable words. Theoret. Comput. Sci. 69, 319\u2013345 (1989)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.2140\/pjm.1979.85.261","volume":"85","author":"DR Bean","year":"1979","unstructured":"Bean, D.R., Ehrenfeucht, A., McNulty, G.F.: Avoidable patterns in strings of symbols. Pacific J. Math. 85, 261\u2013294 (1979)","journal-title":"Pacific J. Math."},{"key":"10_CR3","unstructured":"Cassaigne, J.: Motifs \u00e9vitables et r\u00e9gularit\u00e9 dans les mots, Ph.D. thesis, Universit\u00e9 Paris VI (1994)"},{"key":"10_CR4","unstructured":"Clark, R.J.: Avoidable formulas in combinatorics on words, Ph.D. thesis, University of California, Los Angeles (2001)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Currie, J.D., Lafrance, P.: Avoidability index for binary patterns with reversal. Electron. J. Combin. 23(1) (2016). Paper #P1.36","DOI":"10.37236\/5483"},{"key":"10_CR6","unstructured":"Currie, J., Mol, L., Rampersad, N.: A family of formulas with reversal of high avoidability index (Submitted)"},{"key":"10_CR7","unstructured":"Currie, J., Mol, L., Rampersad, N.: On avoidability of formulas with reversal (Submitted)"},{"key":"10_CR8","unstructured":"Currie, J., Rampersad, N.: Binary words avoiding $$xx^Rx$$ and strongly unimodal sequences. J. Integer Seq. 15, Article 15.10.3 (2015)"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/j.tcs.2015.11.004","volume":"609","author":"J Currie","year":"2016","unstructured":"Currie, J., Rampersad, N.: Growth rate of binary words avoiding $$xxx^R$$ . Theoret. Comput. Sci. 609, 456\u2013468 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.tcs.2016.10.005","volume":"657","author":"CF Du","year":"2017","unstructured":"Du, C.F., Mousavi, H., Rowland, E., Schaeffer, L., Shallit, J.: Decision algorithms for Fibonacci-automatic words, II: related sequences and avoidability. Theoret. Comput. Sci. 657, 146\u2013162 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR11","unstructured":"Gawrychowski, P., I, T., Inenaga, S., K\u00f6ppl, D., Manea, F.: Efficiently finding all maximal alpha-gapped repeats. In: Proceedings of the STACS, pp. 39:1\u201339:14 (2016)"},{"key":"10_CR12","unstructured":"Gawrychowski, P., Manea, F., Nowotka, D.: Testing generalised freeness of words. In: Proceedings of the STACS, pp. 337\u2013349 (2014)"},{"key":"10_CR13","unstructured":"Kosolobov, D., Manea, F., Nowotka, D.: Detecting unary patterns. ArXiv preprint: https:\/\/arxiv.org\/abs\/1604.00054"},{"issue":"2","key":"10_CR14","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1070\/SM1984v047n02ABEH002647","volume":"47","author":"AI Zimin","year":"1984","unstructured":"Zimin, A.I.: Blocking sets of terms. Math. USSR Sbornik 47(2), 353\u2013364 (1984). (English translation)","journal-title":"Math. USSR Sbornik"}],"container-title":["Lecture Notes in Computer Science","Unveiling Dynamics and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58741-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T09:25:51Z","timestamp":1602062751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58741-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587400","9783319587417"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58741-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}