{"title":"树形换能器、L系统和双向机器(扩展摘要)","authors":"J. Engelfriet, G. Rozenberg, G. Slutzki","doi":"10.1145/800133.804333","DOIUrl":null,"url":null,"abstract":"This extended abstract is a condensed version of the results presented in two technical reports ([16] and [13]). In [16] a systematic treatment of the relationships between parallel rewriting systems (top-down tree transducer, ETOL system) and two-way machines (2-way gsm, tree-walking automaton, checking stack automaton) is given. Particular attention is paid to the effect of restricting the copying power of these devices. In [13] the results of [16] are employed to show that the iteration of nondeterministic top-down tree transducers, of nondeterministic 2-way gsm's and of control on ETOL systems each gives rise to a proper hierarchy.","PeriodicalId":313820,"journal":{"name":"Proceedings of the tenth annual ACM symposium on Theory of computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1978-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Tree transducers, L systems and two-way machines (Extended Abstract)\",\"authors\":\"J. Engelfriet, G. Rozenberg, G. Slutzki\",\"doi\":\"10.1145/800133.804333\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This extended abstract is a condensed version of the results presented in two technical reports ([16] and [13]). In [16] a systematic treatment of the relationships between parallel rewriting systems (top-down tree transducer, ETOL system) and two-way machines (2-way gsm, tree-walking automaton, checking stack automaton) is given. Particular attention is paid to the effect of restricting the copying power of these devices. In [13] the results of [16] are employed to show that the iteration of nondeterministic top-down tree transducers, of nondeterministic 2-way gsm's and of control on ETOL systems each gives rise to a proper hierarchy.\",\"PeriodicalId\":313820,\"journal\":{\"name\":\"Proceedings of the tenth annual ACM symposium on Theory of computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1978-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the tenth annual ACM symposium on Theory of computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800133.804333\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the tenth annual ACM symposium on Theory of computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800133.804333","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Tree transducers, L systems and two-way machines (Extended Abstract)
This extended abstract is a condensed version of the results presented in two technical reports ([16] and [13]). In [16] a systematic treatment of the relationships between parallel rewriting systems (top-down tree transducer, ETOL system) and two-way machines (2-way gsm, tree-walking automaton, checking stack automaton) is given. Particular attention is paid to the effect of restricting the copying power of these devices. In [13] the results of [16] are employed to show that the iteration of nondeterministic top-down tree transducers, of nondeterministic 2-way gsm's and of control on ETOL systems each gives rise to a proper hierarchy.