TY - JOUR
T1 - Tree transducers, L systems, and two-way machines
AU - Engelfriet, Joost
AU - Rozenberg, Grzegorz
AU - Slutzki, Giora
PY - 1980
Y1 - 1980
N2 - A relationship between parallel rewriting systems and two-way machines is investigated. Restrictions on the “copying power” of these devices endow them with rich structuring and give insight into the issues of determinism, parallelism, and copying. Among the parallel rewriting systems considered are the top-down tree transducer; the generalized syntax-directed translation scheme and the ETOL system, and among the two-way machines are the tree-walking automaton, the two-way finite-state transducer, and (generalizations of) the one-way checking stack automaton. The. relationship of these devices to macro grammars is also considered. An effort is made .to provide a systematic survey of a number of existing results.
AB - A relationship between parallel rewriting systems and two-way machines is investigated. Restrictions on the “copying power” of these devices endow them with rich structuring and give insight into the issues of determinism, parallelism, and copying. Among the parallel rewriting systems considered are the top-down tree transducer; the generalized syntax-directed translation scheme and the ETOL system, and among the two-way machines are the tree-walking automaton, the two-way finite-state transducer, and (generalizations of) the one-way checking stack automaton. The. relationship of these devices to macro grammars is also considered. An effort is made .to provide a systematic survey of a number of existing results.
U2 - 10.1016/0022-0000(80)90058-6
DO - 10.1016/0022-0000(80)90058-6
M3 - Article
VL - 20
SP - 150
EP - 202
JO - Journal of computer and system sciences
JF - Journal of computer and system sciences
SN - 0022-0000
IS - 2
ER -