The HOM problem is decidable

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 485-494

  Godoy, Guillem ^a   Giménez, Omer ^a   Ramos, Lander ^a   Álvarez, Carme ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

homomorphisms; regular languages; transducers; tree automata

Indexed keywords

EQUALITY CONSTRAINTS; HOMOMORPHISMS; INCLUSION PROBLEM; INEQUALITY CONSTRAINT; INTERMEDIATE RESULTS; NEW CONSTRUCTION; PUMPING MECHANISM; REGULAR LANGUAGES; REGULAR TREE LANGUAGES; TREE AUTOMATA; UNIVERSALITY PROBLEM;

COMPUTABILITY AND DECIDABILITY; CONSTRAINT THEORY; LINGUISTICS; PUMPS; QUERY LANGUAGES; ROBOTS; TRANSDUCERS; TRANSLATION (LANGUAGES); TREES (MATHEMATICS);

AUTOMATA THEORY;

EID: 77954718350     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806757     Document Type: Conference Paper

References (24)

1. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, New York, 1998.
2. B. Bogaert, F. Seynhaeve, and S. Tison. The recognizability problem for tree automata with comparison between brothers. In Foundations of Software Science and Computation Structures (FOSSACS), pages 150-164, 1999.
3. B. Bogaert and S. Tison. Equality and disequality constraints on direct subterms in tree automata. In International Symposium on Theoretical Aspects of Computer Science (STACS), pages 161-171, 1992.
4. H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available at http://www.grappa.univ-lille3.fr/tata, 2007.
5. H. Comon and C. Delor. Equational formulae with membership constraints. Information and Computation, 112:167-216, 1994.
6. H. Comon and F. Jacquemard. Ground reducibility and automata with disequality constraints. In International Symposium on Theoretical Aspects of Computer Science (STACS), pages 151-162, 1994.
7. H. Comon and F. Jacquemard. Ground reducibility is EXPTIME-complete. In Logic in Computer Science (LICS), pages 26-34, 1997.
8. M. Dauchet, A.-C. Caron, and J.-L. Coquidé. Automata for reduction properties solving. Journal of Symbolic Computation, 20(2):215-233, 1995.
9. J. Engelfriet. Bottom-up and top-down tree transformations - a comparison. Mathematical Systems Theory, 9(3):198-231, 1975.
10. Z. Fülöp. Undecidable properties of deterministic top-down tree transducers. Theoretical Computer Science, 134:311-328, 1994.
11. A. Gascón, G. Godoy, and F. Jacquemard. Closure of tree automata languages under innermost rewriting. Electronic Notes Theoretical Computer Science, 237:23-38, 2009.
12. F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, 1984.
13. F. Gécseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 1-68. Springer-Verlag, 1997.
14. R. Gilleron. Decision problems for term rewriting systems and recognizable tree languages. In International Symposium on Theoretical Aspects of Computer Science (STACS), pages 148-159, 1991.
15. G. Godoy, O. Giménez, L. Ramos, and C. Àlvarez. The hom problem is decidable. Available at www.lsi.upc.edu/~ggodoy/publications.html.
16. G. Godoy and E. Huntingford. Innermost-reachability and innermost-joinability are decidable for shallow term rewrite systems. In Term Rewriting and Applications (RTA), pages 184-199, 2007.
17. G. Godoy, S. Maneth, and S. Tison. Classes of tree homomorphisms with decidable preservation of regularity. In Foundations of Software Science and Computation Structures (FOSSACS), pages 127-141, 2008.
18. D. Hofbauer and M. Huber. Computing linearizations using test sets. In Third International Workshop on Conditional Term Rewriting Systems (CTRS), pages 287-301, 1992.
19. Florent Jacquemard, Francis Klay, and Camille Vacher. Rigid tree automata. In Language and Automata Theory and Applications (LATA), pages 446-457, 2009.
20. G. Kucherov and M. Tajine. Decidability of regularity and related properties of ground normal form languages. Information and Compuation, 118:91-100, 1995.
21. Thomas Schwentick. Automata for xml - a survey. Journal of Computer and Systems Sciences, 73(3):289-315, 2007.
22. J. W. Thatcher. Generalized2 sequential machine maps. Computer and System Sciences, 4:339-367, 1970.
23. J. W. Thatcher and J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1):57-81, 1968.
24. S. Vágvölgyi and R. Gilleron. For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable. Bulletin of the EATCS, 48:197-209, 1992.