Intercalation lemmas for tree transducer languages

DOI10.1016/S0022-0000(76)80040-2zbMath0356.68079WikidataQ124817782 ScholiaQ124817782MaRDI QIDQ1237574

C. Raymond Perrault

Publication date: 1976

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Intercalation lemmas for tree transducer languages