Classes of Tree Homomorphisms with Decidable Preservation of Regularity
From MaRDI portal
Publication:5458355
DOI10.1007/978-3-540-78499-9_10zbMATH Open1139.68032OpenAlexW4301036742MaRDI QIDQ5458355FDOQ5458355
Authors: 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
Recommendations
- On degree-preserving homeomorphisms between trees in computable topology
- scientific article; zbMATH DE number 475426
- scientific article; zbMATH DE number 223548
- Decidability of irreducible tree shifts of finite type
- Decidability of Conjugacy of Tree-Shifts of Finite Type
- Decidability and Invariant Classes for Degree Structures
- On the preservation of combinatorial types for maps on trees.
- Complexity of tree homomorphisms
- On the classification of automorphisms of trees
- Tree homomorphisms for unranked trees
Cites Work
- Title not available (Why is that?)
- Bottom-up and top-down tree transformations— a comparison
- Title not available (Why is that?)
- Translations on a context free grammar
- Foundations of XML processing. The tree-automata approach.
- Undecidable properties of deterministic top-down tree transducers
- On the complexity of typechecking top-down XML transformations
- Explicit representation of terms defined by counter examples
- Equational formulae with membership constraints
- Decidability of regularity and related properties of ground normal form languages
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Classes of Tree Homomorphisms with Decidable Preservation of Regularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458355)
