{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T21:42:00Z","timestamp":1649022120871},"reference-count":20,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1051\/ita:2008015","type":"journal-article","created":{"date-parts":[[2008,6,2]],"date-time":"2008-06-02T11:45:58Z","timestamp":1212407158000},"page":"481-502","source":"Crossref","is-referenced-by-count":0,"title":["A new algebraic invariant for weak equivalence of sofic subshifts"],"prefix":"10.1051","volume":"42","author":[{"given":"Laura","family":"Chaubard","sequence":"first","affiliation":[]},{"given":"Alfredo","family":"Costa","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2008,6,3]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"J. Almeida,Finite semigroups and universal algebra, World Scientific, Singapore (1995), English translation.","DOI":"10.1142\/9789812831644"},{"key":"R2","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/j.tcs.2005.07.007","volume":"345","author":"B\u00e9al","year":"2005","journal-title":"Theoret. Comput. Sci."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"M.-P. B\u00e9al, F. Fiorenzi, and D. Perrin, The syntactic graph of a sofic shift is invariant under shift equivalence.Int. J. Algebra Comput.16(2006), 443\u2013460.","DOI":"10.1142\/S0218196706003050"},{"key":"R4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0196-8858(02)00004-0","volume":"29","author":"B\u00e9al","year":"2002","journal-title":"Adv. Appl. Math."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"D. Beauquier, Minimal automaton for a factorial transitive rational language.Theoret. Comput. Sci.67(1985), 65\u201373.","DOI":"10.1016\/0304-3975(89)90022-4"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"F. Blanchard and G. Hansel, Syst\u00e8mes cod\u00e9s.Theoret. Comput. Sci.44(1986), 17\u201349.","DOI":"10.1016\/0304-3975(86)90108-8"},{"key":"R7","unstructured":"M. Boyle and W. Krieger,Almost markov and shift equivalent sofic systems, Proceedings of Maryland Special Year in Dynamics 1986\u201387 (J.C. Alexander, ed.). Lect. Notes Math.1342(1988), pp. 33\u201393."},{"key":"R8","unstructured":"M.-P. B\u00e9al,Codage symbolique, Masson (1993)."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"O. Carton, Wreath product and infinite words.J. Pure Appl. Algebra153(2000), 129\u2013150.","DOI":"10.1016\/S0022-4049(99)00093-6"},{"key":"R10","unstructured":"L. Chaubard,L`\u00e9quivalence faible des syst\u00e8mes sofiques, Master's thesis, LIAFA, Universit\u00e9 Paris VII, July 2003, Rapport de stage de DEA."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"A. Costa, Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts.J. Pure Appl. Algebra209(2007), 517\u2013530.","DOI":"10.1016\/j.jpaa.2006.06.016"},{"key":"R12","unstructured":"S. Eilenberg,Automata, languages and machines, vol. B, Academic Press, New York, 1976."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"R. Fischer, Sofic systems and graphs.Monatsh. Math.80(1975), 179\u2013186.","DOI":"10.1007\/BF01319913"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"G. A. Hedlund, Endomorphims and automorphisms of the shift dynamical system.Math. Syst. Theor.3(1969), 320\u2013375.","DOI":"10.1007\/BF01691062"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"W. Krieger, On sofic systems. i.Israel J. Math.48(1984), 305\u2013330.","DOI":"10.1007\/BF02760631"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"D. Lind and B. Marcus,An introduction to symbolic dynamics and coding, Cambridge University Press, Cambridge (1996).","DOI":"10.1017\/CBO9780511626302"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"M. Nasu,Topological conjugacy for sofic systems.Ergod. Theory Dyn. Syst.6(1986), 265\u2013280.","DOI":"10.1017\/S0143385700003448"},{"key":"R18","unstructured":"D. Perrin and J.-E. Pin,Infinite words, Pure and Applied Mathematics, No. 141, Elsevier, London, 2004."},{"key":"R19","doi-asserted-by":"crossref","unstructured":"J.-E. Pin,Varieties of formal languages, Plenum, London (1986), English translation.","DOI":"10.1007\/978-1-4613-2215-3"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"J.-E. Pin,Syntactic semigroups, Handbook of Language Theory (G. Rozenberg and A. Salomaa, eds.), Springer (1997).","DOI":"10.1007\/978-3-642-59136-5_10"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2008015\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T20:51:35Z","timestamp":1557607895000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2008015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,3]]},"references-count":20,"journal-issue":{"issue":"3"},"alternative-id":["ita08012"],"URL":"https:\/\/doi.org\/10.1051\/ita:2008015","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,3]]}}}