1650 search results - page 6 / 330 » The HOM problem is decidable |
86
Voted
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
111
Voted
HYBRID
2001
Springer
15 years 8 months ago
2001
Springer
99
Voted
ITA
2000
15 years 3 months ago
2000
150
Voted
MFCS
2005
Springer
15 years 9 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...
130
Voted
DLT
2008
15 years 5 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...