962 search results - page 57 / 193 » Some Reducibilities on Regular Sets |
DM
2010
13 years 7 months ago
2010
An infinite word is S-automatic if, for all n 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the numeration system S. In this...
JGT
2007
13 years 7 months ago
2007
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
SIAMCO
2010
13 years 2 months ago
2010
A minimum time problem with a nonlinear smooth dynamics and a target satisfying an internal sphere condition is considered. Under the assumption that the minimum time T be continu...
CAV
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refine...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...