962 search results - page 1 / 193 » Some Reducibilities on Regular Sets |
CIE
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We discuss some known and introduce some new reducibilities on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities...
COMBINATORICS
2002
13 years 7 months ago
2002
Let G = (V, E) be a connected undirected graph and S a subset of vertices. If for all vertices v V , the sets Br(v) S are all nonempty and different, where Br(v) denotes the set...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Regular expressions (REs), because of their succinctness and clear syntax, are the common choice to represent regular languages. However, efficient pattern matching or word recogni...
ESSMAC
2003
Springer
14 years 23 days ago
2003
Springer
Abstract. While there is strong motivation for using Gaussian Processes (GPs) due to their excellent performance in regression and classification problems, their computational com...
FMSD
2006
13 years 7 months ago
2006
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...