{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:46:17Z","timestamp":1720201577486},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,7,1]],"date-time":"2017-07-01T00:00:00Z","timestamp":1498867200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T00:00:00Z","timestamp":1625616000000},"content-version":"vor","delay-in-days":1467,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001665","name":"ANR","doi-asserted-by":"publisher","award":["ANR-13-BS02-0003","ANR-11-BS02-0004"],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1016\/j.tcs.2017.03.001","type":"journal-article","created":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T10:47:10Z","timestamp":1489834030000},"page":"3-28","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Specular sets"],"prefix":"10.1016","volume":"684","author":[{"given":"Val\u00e9rie","family":"Berth\u00e9","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1789-1706","authenticated-orcid":false,"given":"Clelia","family":"De Felice","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Delecroix","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Dolce","sequence":"additional","affiliation":[]},{"given":"Julien","family":"Leroy","sequence":"additional","affiliation":[]},{"given":"Dominique","family":"Perrin","sequence":"additional","affiliation":[]},{"given":"Christophe","family":"Reutenauer","sequence":"additional","affiliation":[]},{"given":"Giuseppina","family":"Rindone","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.tcs.2017.03.001_br0010","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/j.tcs.2007.03.019","article-title":"Factor versus palindromic complexity of uniformly recurrent infinite words","volume":"380","author":"Bal\u00e1\u017ei","year":"2007","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2017.03.001_br0020","author":"Bartholdi"},{"key":"10.1016\/j.tcs.2017.03.001_br0030","article-title":"Transductions and Context-Free Languages","volume":"vol. 38","author":"Berstel","year":"1979"},{"key":"10.1016\/j.tcs.2017.03.001_br0040","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.jalgebra.2012.07.013","article-title":"Bifix codes and Sturmian words","volume":"369","author":"Berstel","year":"2012","journal-title":"J. Algebra"},{"key":"10.1016\/j.tcs.2017.03.001_br0050","article-title":"Codes and Automata","volume":"vol. 129","author":"Berstel","year":"2010"},{"key":"10.1016\/j.tcs.2017.03.001_br0060","series-title":"Combinatorics on Words","first-page":"210","article-title":"Specular sets","volume":"vol. 9304","author":"Berth\u00e9","year":"2015"},{"issue":"4","key":"10.1016\/j.tcs.2017.03.001_br0070","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s00605-014-0721-4","article-title":"Acyclic, connected and tree sets","volume":"176","author":"Berth\u00e9","year":"2015","journal-title":"Monatsh. Math."},{"issue":"7","key":"10.1016\/j.tcs.2017.03.001_br0080","doi-asserted-by":"crossref","first-page":"2521","DOI":"10.1016\/j.jpaa.2014.09.014","article-title":"The finite index basis property","volume":"219","author":"Berth\u00e9","year":"2015","journal-title":"J. Pure Appl. Algebra"},{"issue":"5","key":"10.1016\/j.tcs.2017.03.001_br0090","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1016\/j.disc.2014.12.010","article-title":"Maximal bifix decoding","volume":"338","author":"Berth\u00e9","year":"2015","journal-title":"Discrete Math."},{"key":"10.1016\/j.tcs.2017.03.001_br0100","first-page":"1","article-title":"Return words of linear involutions and fundamental groups","author":"Berth\u00e9","year":"2015","journal-title":"Ergodic Theory Dynam. Systems"},{"key":"10.1016\/j.tcs.2017.03.001_br0110","series-title":"Combinatorics, Automata and Number Theory","volume":"vol. 135","year":"2010"},{"issue":"3","key":"10.1016\/j.tcs.2017.03.001_br0120","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1017\/S0143385708080565","article-title":"Dynamics and geometry of the Rauzy\u2013Veech induction for quadratic differentials","volume":"29","author":"Boissy","year":"2009","journal-title":"Ergodic Theory Dynam. Systems"},{"issue":"1","key":"10.1016\/j.tcs.2017.03.001_br0130","doi-asserted-by":"crossref","first-page":"67","DOI":"10.36045\/bbms\/1105730624","article-title":"Complexit\u00e9 et facteurs sp\u00e9ciaux","volume":"4","author":"Cassaigne","year":"1997","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"issue":"3","key":"10.1016\/j.tcs.2017.03.001_br0140","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1112\/jlms\/jdn052","article-title":"R-trees and laminations for free groups. I. Algebraic laminations","volume":"78","author":"Coulbois","year":"2008","journal-title":"J. Lond. Math. Soc. (2)"},{"issue":"8","key":"10.1016\/j.tcs.2017.03.001_br0150","first-page":"409","article-title":"Involutions lin\u00e9aires et feuilletages mesur\u00e9s","volume":"307","author":"Danthony","year":"1988","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. I Math."},{"issue":"3","key":"10.1016\/j.tcs.2017.03.001_br0160","doi-asserted-by":"crossref","first-page":"469","DOI":"10.24033\/asens.1608","article-title":"Measured foliations on nonorientable surfaces","volume":"23","author":"Danthony","year":"1990","journal-title":"Ann. Sci. \u00c9c. Norm. Sup\u00e9r. (4)"},{"key":"10.1016\/j.tcs.2017.03.001_br0170","article-title":"Topics in Geometric Group Theory","author":"de la Harpe","year":"2000"},{"key":"10.1016\/j.tcs.2017.03.001_br0180","article-title":"Groups Acting on Graphs","volume":"vol. 17","author":"Dicks","year":"1989"},{"key":"10.1016\/j.tcs.2017.03.001_br0190","series-title":"Developments in Language Theory","first-page":"215","article-title":"Enumeration formulae in neutral sets","volume":"vol. 9168","author":"Dolce","year":"2015"},{"issue":"part A","key":"10.1016\/j.tcs.2017.03.001_br0200","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.tcs.2016.01.008","article-title":"Neutral and tree sets of arbitrary characteristic","volume":"658","author":"Dolce","year":"2017","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2017.03.001_br0210","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S0304-3975(99)00320-5","article-title":"Episturmian words and some constructions of de Luca and Rauzy","volume":"255","author":"Droubay","year":"2001","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2017.03.001_br0220","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0012-365X(97)00029-0","article-title":"A characterization of substitutive sequences using return words","volume":"179","author":"Durand","year":"1998","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/j.tcs.2017.03.001_br0230","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.ejc.2008.04.006","article-title":"Palindromic richness","volume":"30","author":"Glen","year":"2009","journal-title":"European J. Combin."},{"key":"10.1016\/j.tcs.2017.03.001_br0240","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF01236981","article-title":"Interval exchange transformations","volume":"141","author":"Keane","year":"1975","journal-title":"Math. Z."},{"issue":"6","key":"10.1016\/j.tcs.2017.03.001_br0250","doi-asserted-by":"crossref","first-page":"1813","DOI":"10.1017\/etds.2012.114","article-title":"Lamination languages","volume":"33","author":"Lopez","year":"2013","journal-title":"Ergodic Theory Dynam. Systems"},{"key":"10.1016\/j.tcs.2017.03.001_br0260","article-title":"Algebraic Combinatorics on Words","volume":"vol. 90","author":"Lothaire","year":"2002"},{"key":"10.1016\/j.tcs.2017.03.001_br0270","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61896-3","article-title":"Combinatorial Group Theory","author":"Lyndon","year":"2001"},{"key":"10.1016\/j.tcs.2017.03.001_br0280","article-title":"Presentations of Groups in Terms of Generators and Relations","author":"Magnus","year":"2004"},{"issue":"3","key":"10.1016\/j.tcs.2017.03.001_br0290","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0022-0000(83)90003-X","article-title":"Groups, the theory of ends, and context-free languages","volume":"26","author":"Muller","year":"1983","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/j.tcs.2017.03.001_br0300","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1017\/S0143385700005150","article-title":"Almost all interval exchange transformations with flips are nonergodic","volume":"9","author":"Nogueira","year":"1989","journal-title":"Ergodic Theory Dynam. Systems"},{"issue":"2","key":"10.1016\/j.tcs.2017.03.001_br0310","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1088\/0951-7715\/26\/2\/525","article-title":"Orbit structure of interval exchange transformations with flip","volume":"26","author":"Nogueira","year":"2013","journal-title":"Nonlinearity"},{"key":"10.1016\/j.tcs.2017.03.001_br0320","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.tcs.2013.07.021","article-title":"Palindromic richness for languages invariant under more symmetries","volume":"518","author":"Pelantov\u00e1","year":"2014","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2017.03.001_br0330","article-title":"Trees","author":"Serre","year":"2003"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751730186X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751730186X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T22:46:10Z","timestamp":1625611570000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439751730186X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":33,"alternative-id":["S030439751730186X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2017.03.001","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2017,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Specular sets","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2017.03.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}