Branching synchronization grammars with nested tables
From MaRDI portal
Publication:596320
DOI10.1016/j.jcss.2003.10.001zbMath1069.68060OpenAlexW2043153386MaRDI QIDQ596320
Frank Drewes, Joost Engelfriet
Publication date: 10 August 2004
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2003.10.001
Related Items
MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS ⋮ Selected Decision Problems for Square-Refinement Collage Grammars ⋮ LINKS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic top-down tree transducers with iterated look-ahead
- Pushdown machines for the macro tree transducer
- Compositions with superlinear deterministic top-down tree transformations
- Tree transducers, L systems, and two-way machines
- Surface tree languages and parallel derivation trees
- IO and OI. I
- On tree transducers for partial functions
- Decidability of the finiteness of ranges of tree transductions
- The generating power of total deterministic tree transducers
- Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
- Tree-based picture generation
- Top-down tree transducers with deterministic top-down look-ahead
- The complexity of the exponential output size problem for top-down and bottom-up tree transducers
- Generalized sequential machine maps
- Extension of tabled 0L-systems and languages
- Decomposition Theorems for Various Kinds of Languages Parallel in Nature
- Bottom-up and top-down tree transformations— a comparison
- Top-down tree transducers with regular look-ahead
- Generalized Syntax Directed Translation, Tree Transducers, and Linear Space
- Tree transducers and tree languages
- Composition of top-down and bottom-up tree transductions
- Equivalence of finite-valued tree transducers is decidable
- Decidability of equivalence for a class of non-deterministic tree transducers
- Three hierarchies of transducers
- Mappings and grammars on trees
- Tree-based generation of languages of fractals
