The equivalence problem for letter-to-letter bottom-up tree transducers is solvable

DOI10.1007/3-540-59293-8_193zbMath1496.68170OpenAlexW1565024805MaRDI QIDQ5096729

Francis Bossut, Yves André

Publication date: 18 August 2022

Published in: TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59293-8_193

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

On the equivalence problem for letter-to-letter top-down tree transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular tree transducers
• Macro tree transducers
• Alphabetic tree relations
• On the equivalence problem for letter-to-letter top-down tree transducers
• Bottom-up tree pushdown automata: Classification and connection with rewrite systems
• Generalized sequential machine maps
• Variants of top-down tree transducers with look-ahead
• Bottom-up and top-down tree transformations— a comparison
• Top-down tree transducers with regular look-ahead
• Decidability of equivalence for a class of non-deterministic tree transducers

This page was built for publication: The equivalence problem for letter-to-letter bottom-up tree transducers is solvable