The HOM problem is decidable
From MaRDI portal
Publication:2875176
DOI10.1145/1806689.1806757zbMath1293.68186MaRDI QIDQ2875176
Omer Giménez, Guillem Godoy, Carme Àlvarez, Lander Ramos
Publication date: 13 August 2014
Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1806689.1806757
68Q45: Formal languages and automata
Related Items
Paths, tree homomorphisms and disequalities for -clauses, Projection for Büchi Tree Automata with Constraints between Siblings, Parameter reduction and automata evaluation for grammar-compressed trees, Crossing the Syntactic Barrier: Hom-Disequalities for ${\mathcal H}_1$-Clauses, Tree Automata, (Dis-)Equality Constraints and Term Rewriting