{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:50Z","timestamp":1761610130099,"version":"build-2065373602"},"reference-count":15,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3831,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s1571-0661(04)80533-4","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"55-70","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["The synchronized graphs trace the context-sensitive languages"],"prefix":"10.1016","volume":"68","author":[{"given":"Chlo\u00e9","family":"Rispal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80533-4_NEWBIB1","first-page":"51","article-title":"Automatic structures","volume":"15","author":"Blumensath","year":"2002","journal-title":"LICS"},{"key":"10.1016\/S1571-0661(04)80533-4_NEWBIB2","unstructured":"A. Carayol, A characterization of context-sensitive langages, report, (2001)."},{"key":"10.1016\/S1571-0661(04)80533-4_NEWBIB3","doi-asserted-by":"crossref","unstructured":"D. Caucal, On infinite transition graphs having a decidable monadic theory, ICALP 23, LNCS 1099, F. Meyer aufder, Heide, B. Monien, (1996), 194\u2013205 [a full version will appear in Theoretical Computer Science]","DOI":"10.1007\/3-540-61440-0_128"},{"key":"10.1016\/S1571-0661(04)80533-4_NEWBIB4","doi-asserted-by":"crossref","unstructured":"D. Caucal On transition graphs of Turing machines, MCU 3, LNCS 2055, M. Margenstern, Y. Rogozhin, (2201), 177\u2013189.","DOI":"10.1007\/3-540-45132-3_11"},{"key":"10.1016\/S1571-0661(04)80533-4_NEWBIB5","first-page":"193","article-title":"Graph rewriting: an algebraic and logic approach","volume":"B","author":"Courcelle","year":"1990","journal-title":"Handbook of Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80533-4_NEWBIB6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1147\/rd.91.0047","article-title":"On relations defined by generalized finite automata","volume":"9","author":"Elgot","year":"1965","journal-title":"IBM J. Res. Dev"},{"key":"10.1016\/S1571-0661(04)80533-4_NEWBIB7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","article-title":"Synchronized rational relations of finite and infinite words","volume":"108","author":"Frougny","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80533-4_NEWBIB8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","article-title":"Classes of languages and linear-bounded automata","volume":"7","author":"Kuroda","year":"1964","journal-title":"Information and Control"},{"key":"10.1016\/S1571-0661(04)80533-4_NEWBIB9","doi-asserted-by":"crossref","unstructured":"C. Morvan On rational graphs, FOSSACS 3, Berlin, J. Tiuryn, LNCS 1784, (2000), 252\u2013266.","DOI":"10.1007\/3-540-46432-8_17"},{"key":"10.1016\/S1571-0661(04)80533-4_NEWBIB10","doi-asserted-by":"crossref","unstructured":"C. Morvan and C. Stirling Rational graphs trace context-sensitive langages, MFCS 26, Mari\u00e1Ansk\u00e9A, L\u00e1Azn\u011b, A. Pultr and J. Sgall, LNCS, (2001).","DOI":"10.1007\/3-540-44683-4_48"},{"key":"10.1016\/S1571-0661(04)80533-4_NEWBIB11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","article-title":"The theory of ends, pushdown automata, and second-order logic","volume":"37","author":"Muller","year":"1985","journal-title":"TCS"},{"key":"10.1016\/S1571-0661(04)80533-4_NEWBIB12","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0019-9958(74)91049-3","article-title":"One-sided and two-sided context in formal grammars","volume":"25","author":"Penttonen","year":"1974","journal-title":"Information and Control"},{"key":"10.1016\/S1571-0661(04)80533-4_NEWBIB13","first-page":"1","article-title":"Decidability of second order-theories and automata on finite trees","volume":"141","author":"Rabin","year":"1969","journal-title":"Trans. Amer. Math. Soc"},{"key":"10.1016\/S1571-0661(04)80533-4_NEWBIB14_1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Dev"},{"year":"1965","series-title":"Sequential machines","author":"Moore","key":"10.1016\/S1571-0661(04)80533-4_NEWBIB14_2"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805334?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805334?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:05:36Z","timestamp":1761609936000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805334"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S1571066104805334"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80533-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2003,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The synchronized graphs trace the context-sensitive languages","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80533-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}