Classes of Tree Homomorphisms with Decidable Preservation of Regularity

DOI10.1007/978-3-540-78499-9_10zbMath1139.68032OpenAlexW4301036742MaRDI QIDQ5458355

Guillem Godoy, Sebastian Maneth, Sophie Tison

Publication date: 11 April 2008

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78499-9_10

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

The HOM Problem is EXPTIME-Complete

Cites Work

• On the complexity of typechecking top-down XML transformations
• Explicit representation of terms defined by counter examples
• Equational formulae with membership constraints
• Undecidable properties of deterministic top-down tree transducers
• Decidability of regularity and related properties of ground normal form languages
• Bottom-up and top-down tree transformations— a comparison
• Translations on a context free grammar
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Classes of Tree Homomorphisms with Decidable Preservation of Regularity