Surface tree languages and parallel derivation trees
From MaRDI portal
Publication:1233730
DOI10.1016/0304-3975(76)90003-7zbMATH Open0346.68040OpenAlexW2042725192MaRDI QIDQ1233730FDOQ1233730
Authors: Joost Engelfriet 
Publication date: 1976
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/surface-tree-languages-and-parallel-derivation-trees(d8768bf2-fa8f-4484-abe2-20d99d0c66c4).html
Cites Work
- Bottom-up and top-down tree transformations— a comparison
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Generalized sequential machine maps
- Mappings and grammars on trees
- Description of developmental languages using recurrence systems
- Extension of tabled 0L-systems and languages
- Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- L systems
- On extensions of ALGOL-like languages
Cited In (11)
- Un théorème de duplication pour les forets algébriques
- On tree transducers for partial functions
- The OI-hierarchy is closed under control
- The generating power of total deterministic tree transducers
- Branching synchronization grammars with nested tables
- Tree transducers, L systems, and two-way machines
- Copying theorems
- The translation power of top-down tree-to-graph transducers
- MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS
- Three hierarchies of transducers
- Systolic trees and systolic language recognition by tree automata
This page was built for publication: Surface tree languages and parallel derivation trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1233730)
