1650 search results - page 6 / 330 » The HOM problem is decidable |
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
HYBRID
2001
Springer
14 years 2 days ago
2001
Springer
ITA
2000
13 years 7 months ago
2000
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
DLT
2008
13 years 9 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...