Sciweavers

11 search results - page 3 / 3
» Categorial Grammar and Semiotic Universal Grammar
Sort
View
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
14 years 2 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...