1650 search results - page 37 / 330 » The HOM problem is decidable |
APAL
2005
13 years 7 months ago
2005
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
ISTCS
1997
Springer
13 years 11 months ago
1997
Springer
We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no
CORR
2012
Springer
12 years 3 months ago
2012
Springer
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Sche...
AI
2005
Springer
14 years 1 months ago
2005
Springer
Identity uncertainty is the task of deciding whether two descriptions correspond to the same object. In this paper we discuss the identity uncertainty problem in the context of the...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is deci...