{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:23:35Z","timestamp":1759332215450,"version":"3.30.2"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00655-2","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T21:25:27Z","timestamp":1045517127000},"page":"195-223","source":"Crossref","is-referenced-by-count":7,"title":["On the transition graphs of turing machines"],"prefix":"10.1016","volume":"296","author":[{"given":"Didier","family":"Caucal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00655-2_BIB1","unstructured":"A. Arnold, M. Nivat, Comportements de processus, Colloque AFCET \u2018Les math\u00e9matiques de l'informatique\u2019, 1982, pp. 35\u201368."},{"key":"10.1016\/S0304-3975(02)00655-2_BIB2","first-page":"543","article-title":"When can an equational simple graph be generated by hyperedge replacement","volume":"Vol. 1450","author":"Barthelmann","year":"1998"},{"key":"10.1016\/S0304-3975(02)00655-2_BIB3","first-page":"1188","article-title":"Parties rationnelles du groupe libre","volume":"269","author":"Benois","year":"1969","journal-title":"C.R. Acad\u00e9mie Sci. Paris, S\u00e9r. A"},{"year":"1979","series-title":"Transductions and Context-Free Languages","author":"Berstel","key":"10.1016\/S0304-3975(02)00655-2_BIB4"},{"key":"10.1016\/S0304-3975(02)00655-2_BIB5","doi-asserted-by":"crossref","unstructured":"A. Blumensath, E. Gr\u00e4del, Automatic structures, 15th LICS, IEEE, 2000, pp. 51\u201362.","DOI":"10.1109\/LICS.2000.855755"},{"key":"10.1016\/S0304-3975(02)00655-2_BIB6","series-title":"Texts and Monographs in Computer Science","article-title":"String-rewriting systems","author":"Book","year":"1993"},{"key":"10.1016\/S0304-3975(02)00655-2_BIB7","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01969548","article-title":"Regular canonical systems","volume":"6","author":"B\u00fcchi","year":"1964","journal-title":"Arch. Math. Logik Grundlag."},{"key":"10.1016\/S0304-3975(02)00655-2_BIB8","first-page":"331","article-title":"A string-rewriting characterization of Muller and Schupp's context-free graphs","volume":"Vol. 1530","author":"Calbrix","year":"1998"},{"key":"10.1016\/S0304-3975(02)00655-2_BIB9","series-title":"15th CAAP","first-page":"87","article-title":"On the regular structure of prefix rewriting","volume":"Vol. 431","author":"Caucal","year":"1990"},{"key":"10.1016\/S0304-3975(02)00655-2_BIB10","unstructured":"D. Caucal, Bisimulation of context-free grammars and of pushdown automata, CSLI, Vol. 53, in: A. Ponse, M. de Rijke, Y. Venema (Eds.), Modal Logic and Process Algebra, Stanford, 1995, pp. 85\u2013106."},{"key":"10.1016\/S0304-3975(02)00655-2_BIB11","series-title":"23rd ICALP","first-page":"194","article-title":"On infinite transition graphs having a decidable monadic theory","volume":"Vol. 1099","author":"Caucal","year":"1996"},{"key":"10.1016\/S0304-3975(02)00655-2_BIB12","first-page":"48","article-title":"On word rewriting systems having a rational derivation","volume":"Vol. 1784","author":"Caucal","year":"2000"},{"issue":"4","key":"10.1016\/S0304-3975(02)00655-2_BIB13","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s00224-001-1015-5","article-title":"An internal presentation of regular graphs by prefix-recognizable ones","volume":"34","author":"Caucal","year":"2001","journal-title":"Theory Comput. Systems"},{"key":"10.1016\/S0304-3975(02)00655-2_BIB14","first-page":"177","article-title":"On a Chomsky-like hierarchy of infinite graphs","volume":"Vol. 2420","author":"Caucal","year":"2002"},{"key":"10.1016\/S0304-3975(02)00655-2_BIB15","first-page":"193","article-title":"Graph rewriting","volume":"Vol. B","author":"Courcelle","year":"1990"},{"key":"10.1016\/S0304-3975(02)00655-2_BIB16","first-page":"243","article-title":"Rewrite systems","volume":"Vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S0304-3975(02)00655-2_BIB17","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\/S0304-3975(02)00655-2_BIB18","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":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00655-2_BIB19","first-page":"175","article-title":"Aspects of classical language theory","volume":"Vol. 1","author":"Mateescu","year":"1997"},{"key":"10.1016\/S0304-3975(02)00655-2_BIB20","first-page":"252","article-title":"On rational graphs","volume":"Vol. 1784","author":"Morvan","year":"2000"},{"key":"10.1016\/S0304-3975(02)00655-2_BIB21","first-page":"548","article-title":"Rational graphs trace context-sensitive languages","volume":"Vol. 2136","author":"Morvan","year":"2001"},{"key":"10.1016\/S0304-3975(02)00655-2_BIB22","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":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00655-2_BIB23","unstructured":"E. Payet, Produit synchronis\u00e9 pour quelques classes de graphes infinis, Ph.D. Thesis, University of La R\u00e9union, 2000."},{"key":"10.1016\/S0304-3975(02)00655-2_BIB24","unstructured":"C. Rispal, The synchronized graphs trace the context-sensitive languages, DEA Rep. University of Rennes, 2001."},{"key":"10.1016\/S0304-3975(02)00655-2_BIB25","first-page":"680","article-title":"Regularity of congruential graphs","volume":"Vol. 1893","author":"Urvoy","year":"2000"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502006552?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502006552?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T19:26:46Z","timestamp":1733945206000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502006552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502006552"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00655-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}