Forward and backward application of symbolic tree transducers

DOI10.1007/S00236-014-0197-7zbMath1307.68047arXiv1208.5324OpenAlexW2031404106MaRDI QIDQ404011

Zoltán Fülöp, Heiko Vogler

Publication date: 29 August 2014

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.5324

zbMATH Keywords

XMLsymbolic computationcompositiontree automatonregular tree grammarrelabellingtop-down tree transducertree transducer

Mathematics Subject Classification ID

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

Related Items (2)

Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics ⋮ Symbolic tree automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automatic verification of recursive procedures with one integer parameter.
• XML with data values: Typechecking revisited.
• A comparison of pebble tree transducers with macro tree transducers
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Generalized sequential machine maps
• Tree acceptors and some of their applications
• Symbolic finite state transducers
• An Automata Model for Trees with Ordered Data Values
• Variable Tree Automata over Infinite Ranked Alphabets
• Variable Automata over Infinite Alphabets
• Bottom-up and top-down tree transformations— a comparison
• Composition of top-down and bottom-up tree transductions
• Rewriting Systems with Data
• Tree Automata over Infinite Alphabets
• Tree generating regular systems
• Mappings and grammars on trees
• One-unambiguous regular languages

This page was built for publication: Forward and backward application of symbolic tree transducers