Author:
Maletti Andreas,Nász Andreea-Teodora
Abstract
AbstractThe HOM problem, which asks whether the image of a regular tree language under a given tree homomorphism is again regular, is known to be decidable [Godoy & Giménez: The HOM problem is decidable. JACM 60(4), 2013]. However, the problem remains open for regular weighted tree languages. It is demonstrated that the main notion used in the unweighted setting, the tree automaton with equality and inequality constraints , can straightforwardly be generalized to the weighted setting and can represent the image of any regular weighted tree language under any nondeleting and nonerasing tree homomorphism. Several closure properties as well as decision problems are also investigated for the weighted tree languages generated by weighted tree automata with constraints.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference31 articles.
1. Bogaert, B., Tison, S.: Equality and disequality constraints on direct subterms in tree automata. In: A. Finkel, M. Jantzen (eds.) Proc. 9th Ann. Symp. Theoretical Aspects of Computer Science, LNCS, vol. 577, pp. 161–171. Springer (1992). https://doi.org/10.1007/3-540-55210-3_181
2. Borchardt, B.: The theory of recognizable tree series. Ph.D. thesis, Technische Universität Dresden (2005)
3. Bozapalidis, S., Rahonis, G.: On the closure of recognizable tree series under tree homomorphisms. J. Autom. Lang. Comb. 10(2–3), 185–202 (2005). https://doi.org/10.25596/jalc-2005-185
4. Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata —Techniques and applications. (2007) http://www.grappa.univ-lille3.fr/tata
5. Comon, H., Jacquemard, F.: Ground reducibility and automata with disequality constraints. In: P. Enjalbert, E.W. Mayr, K.W. Wagner (eds.) Proc. 11th Ann. Symp. Theoretical Aspects of Computer Science, LNCS, vol. 775, pp. 151–162, Springer (1994). https://doi.org/10.1007/3-540-57785-8_138
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献