{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T04:50:27Z","timestamp":1768279827192,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7716,"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":[[1992,6]]},"DOI":"10.1016\/0304-3975(92)90348-j","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"177-211","source":"Crossref","is-referenced-by-count":15,"title":["Alphabetic tree relations"],"prefix":"10.1016","volume":"99","author":[{"given":"Symeon","family":"Bozapalidis","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0304-3975(92)90348-J_BIB1","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/S0019-9958(78)90510-7","article-title":"For\u00eats alg\u00e8briques et homomorphisme inverses","volume":"37","author":"Arnold","year":"1978","journal-title":"Inform. and Control"},{"issue":"3","key":"10.1016\/0304-3975(92)90348-J_BIB2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0019-9958(78)90538-7","article-title":"Tree transducers and tree languages","volume":"37","author":"Baker","year":"1978","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(92)90348-J_BIB3","series-title":"Transductions and Context-Free Languages","author":"Berstel","year":"1979"},{"issue":"1","key":"10.1016\/0304-3975(92)90348-J_BIB4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1051\/ita\/1988220100431","article-title":"Sur une classe des relations d'arbres","volume":"22","author":"Bozapalidis","year":"1988","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/0304-3975(92)90348-J_BIB5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1080\/00207168908803784","article-title":"Actions, finite state sets and applications to trees","volume":"31","author":"Bozapalidis","year":"1989","journal-title":"Internat. J. Computer and Math."},{"key":"10.1016\/0304-3975(92)90348-J_BIB6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(78)90039-7","article-title":"A representation of trees by languages II","volume":"7","author":"Courcelle","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90348-J_BIB7","article-title":"Transductions de for\u00eats. Bimorphismes de magmoides","volume":"I","author":"Dauchet","year":"1977"},{"key":"10.1016\/0304-3975(92)90348-J_BIB8","series-title":"Automata, Languages and Machines","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(92)90348-J_BIB9","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF01704020","article-title":"Bottom-up, top-down tree transformations: a comparison","volume":"9","author":"Engelfriet","year":"1975","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(92)90348-J_BIB10","first-page":"103","article-title":"A hierarchy of tree transducers","author":"Engelfriet","year":"1978","journal-title":"Proc. 3me Colloque de Lille sur les arbres en Alg\u00e8bre et en Programmation"},{"issue":"3","key":"10.1016\/0304-3975(92)90348-J_BIB11","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","article-title":"IO and OI, I","volume":"15","author":"Engelfriet","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90348-J_BIB12","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01695769","article-title":"Mappings and grammars on trees","volume":"4","author":"Rounds","year":"1970","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(92)90348-J_BIB13","series-title":"Automata, Languages and Programming","first-page":"475","article-title":"Primitive transformations on regular sets and recognizable sets","author":"Takahashi","year":"1973"},{"key":"10.1016\/0304-3975(92)90348-J_BIB14","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/S0022-0000(70)80017-4","article-title":"Generalized2 sequential machine maps","volume":"1","author":"Thatcher","year":"1970","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/0304-3975(92)90348-J_BIB15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","article-title":"Generalized finite automata theory with an application to a decision problem of second-order logic","volume":"2","author":"Thatcher","year":"1968","journal-title":"Math. Systems Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290348J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290348J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:58:33Z","timestamp":1555113513000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290348J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["030439759290348J"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90348-j","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}