Tree transducers, L systems, and two-way machines
type: Item
instance of: scholarly article
title: Tree transducers, L systems, and two-way machines
zbMATH Open document ID: 0426.68075
DOI: 10.1016/0022-0000(80)90058-6
author: Joost Engelfriet
author: Grzegorz Rozenberg
author: Giora Slutzki
published in: Journal of Computer and System Sciences
publication date: 1980-01-01T00:00:00Z
full work available at URL: tree-transducers-l-systems-and-twoway-machines(b76e9957-faa8-428c-a733-850384551c4d).html
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68-02
zbMATH DE Number: 3664409
zbMATH Keywords: top-down tree transducers
zbMATH Keywords: generalized syntax-directed translation
zbMATH Keywords: L systems
zbMATH Keywords: ETOL systems
zbMATH Keywords: two-way transducers
zbMATH Keywords: checking machines
zbMATH Keywords: macro grammars
zbMATH Keywords: checking tree pushdown transducer
MaRDI profile type: Publication
OpenAlex ID: W2087945397
cites work: Properties of syntax directed translations
cites work: Syntax directed translations and the pushdown assembler
cites work: A characterization of two-way deterministic classes of languages
cites work: Translations on a context free grammar
cites work: Controlled iteration grammars and full hyper-AFL's
cites work: Iterated deterministic-substitution
cites work: Tree transducers and tree languages
cites work: Q4051626
cites work: Q4138161
cites work: On some families of languages related to developmental systems
cites work: Q4157957
cites work: Q4062663
cites work: On ETOL systems with rank
cites work: Two-way sequential transductions and stack automata
cites work: Bottom-up and top-down tree transformations— a comparison
cites work: Top-down tree transducers with regular look-ahead
cites work: Surface tree languages and parallel derivation trees
cites work: Q4954439
cites work: Q4138163
cites work: Three hierarchies of transducers
cites work: Copying theorems
cites work: IO and OI. II
cites work: Stack Machines and Classes of Nonnested Macro Languages
cites work: Extended macro grammars and stack controlled machines
cites work: TOL schemes and control sets
cites work: AFL with the semilinear property
cites work: Checking automata and one-way stack languages
cites work: Full AFLs and nested iterated substitution
cites work: Syntactic operators on full semiAFLs
cites work: Control sets on context-free grammar forms
cites work: One way finite visit automata
cites work: Q5592246
cites work: Simple matrix languages
cites work: Controlled pushdown automata
cites work: A geometric hierarchy of languages
cites work: Control sets on linear grammars
cites work: Two-way A-transducers and AFL
cites work: Q5549810
cites work: Q4131026
cites work: Intercalation lemmas for tree transducer languages
cites work: Absolutely parallel grammars and two-way finite-state transducers
cites work: Bounded-crossing transducers
cites work: Hypergrammars: An extension of macrogrammars
cites work: Mappings and grammars on trees
cites work: Extension of tabled 0L-systems and languages
cites work: On ETOL systems of finite index
cites work: On recursion in ETOL systems
cites work: Q5678435
cites work: On equal matrix languages
cites work: Finite-turn checking automata
cites work: Generalized sequential machine maps
cites work: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
cites work: Generalized finite automata theory with an application to a decision problem of second-order logic
cites work: Substitutions dans les EDT0L systèmes ultralinéaires
cites work: Q3311683
cites work: Generalized Syntax Directed Translation, Tree Transducers, and Linear Space

Tree transducers, L systems, and two-way machines (cites work)
cites work: Composition of top-down and bottom-up tree transductions