Intercalation lemmas for tree transducer languages
From MaRDI portal
Publication:1237574
DOI10.1016/S0022-0000(76)80040-2zbMath0356.68079WikidataQ124817782 ScholiaQ124817782MaRDI QIDQ1237574
Publication date: 1976
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items
Recurrent words and simultaneous growth in T0L systems ⋮ Tree transducers, L systems, and two-way machines ⋮ The copying power of one-state tree transducers ⋮ Deterministic top-down tree transducers with iterated look-ahead ⋮ Augmented transition networks and their relation to tree transducers ⋮ Three hierarchies of transducers ⋮ A pumping lemma for output languages of macro tree transducers
Cites Work
- On derivation trees of indexed grammars - an extension of the uvwxy- theorem
- Augmented transition networks and their relation to tree transducers
- Parallel program schemata
- Generalized sequential machine maps
- Bottom-up and top-down tree transformations— a comparison
- Regular canonical systems
- Intercalation theorems for stack languages
- Mappings and grammars on trees
- Transition network grammars for natural language analysis
- A Formalization of Transition Diagram Systems
- Design of a separable transition-diagram compiler
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
