Iterated relabeling tree transducers

DOI10.1016/S0304-3975(01)00181-5zbMath1002.68077OpenAlexW2093769120MaRDI QIDQ1605311

Alain Terlutte, Zoltán Fülöp

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00181-5

zbMATH Keywords

compositiontree automataterm rewritingfinite state relabeling

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

Shape preserving top-down tree transducers.

Cites Work

• Transductions des langages de Chomsky
• Sur les rélations rationnelles entre monoides libres
• A new proof of two theorems about rational transductions
• Generalized sequential machine maps
• Bottom-up and top-down tree transformations— a comparison
• Iterated a-NGSM maps and Γ systems
• The first-order theory of one-step rewriting is undecidable
• Mappings and grammars on trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Iterated relabeling tree transducers