186 search results - page 20 / 38 » Decidable Extensions of Church's Problem |
ATVA
2010
Springer
13 years 10 months ago
2010
Springer
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
IANDC
2011
13 years 4 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
FCT
2005
Springer
14 years 3 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
Although camera self-calibration and metric reconstruction have been extensively studied during the past decades, automatic metric reconstruction from long video sequences with va...
IROS
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— To autonomously navigate on rough terrain is a challenging problem for mobile robots, requiring the ability to decide whether parts of the environment can be traversed ...