Proceedings ArticleDOI
Tree transducers, L systems and two-way machines (Extended Abstract)
Joost Engelfriet,Grzegorz Rozenberg,G. Slutzki +2 more
- pp 66-74
Reads0
Chats0
TLDR
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.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.read more
Citations
More filters
Journal ArticleDOI
Word-Mappings of Level 2
TL;DR: It is shown here that the sequences of level 2 are exactly the rational formal power series over one undeterminate.
Journal ArticleDOI
Hierarchy theorems for two-way finite state transducers
TL;DR: CAL(ℒ) is defined as the family of images of ℒ under nondeterministic two-way finite state transducers, while FINITE · VISIT(™) is the closure of ™ under deterministicTwo- way finite stateTransducers.
Book ChapterDOI
Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time
Adrien Boiret,Raphaela Palenta +1 more
TL;DR: In this paper, the equivalence of linear top-down tree-to-word transducers is shown to be decidable in polynomial time, based on a partial normal form that provides a basic characterization of the languages produced by linear tree to word transducers.
Journal ArticleDOI
Extended linear macro grammars, iteration grammars, and register programs
TL;DR: It is shown that extended macro Grammars have the same language generating power as (parallel) iteration grammars and can be formulated using iterated substitution using IO and OI versions.
Journal ArticleDOI
Sur les générateurs algébriques et linéaires
TL;DR: The authors showed that the algebraic language E generated by the grammar: S? aSbSc + d dominates all algebraic languages by faithful sequential mappings and showed that no algebraic generator belongs to the family EDTOL.
References
More filters
Journal ArticleDOI
Generalized finite automata theory with an application to a decision problem of second-order logic
TL;DR: The standard closure theorems are proved for the class of sets “recognizable” by finite algebras, and a generalization of Kleene's regularity theory is presented.
Journal ArticleDOI
Mappings and grammars on trees
TL;DR: This paper studies certain sets, functions, and relations on trees using natural generalizations of ordinary automata theory using Thatcher and Wright's algebraic formalism to give succinct descriptions of linguistic constructions in the tree case.
Journal ArticleDOI
Bottom-up and top-down tree transformations - a comparison
TL;DR: A new tree transformation model is introduced which generalizes both the top-down and the bottom-up tree transducer, and is used to give simple proofs of composition results concerning bottom- up tree transformations.
Journal ArticleDOI
Generalized2 sequential machine maps
TL;DR: The concept of generalized sequential machine (gsm) mapping is developed here in its natural extension to trees (or expressions) in the introduction of syntax directed translations and transformations into formallanguage theory.
Proceedings ArticleDOI
Grammars with macro-like productions
TL;DR: Two new classes of grammars based on programming macros are studied, one of which is IO but not OI and the other OI but not IO, showing that neither class contains the other.