Surface tree languages and parallel derivation trees
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3464871 (Why is no real title available?)
- scientific article; zbMATH DE number 3501022 (Why is no real title available?)
- Bottom-up and top-down tree transformations— a comparison
- Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
- Description of developmental languages using recurrence systems
- Extension of tabled 0L-systems and languages
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Generalized sequential machine maps
- L systems
- Mappings and grammars on trees
- Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic 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)
