962 search results - page 33 / 193 » Some Reducibilities on Regular Sets |
AGP
1998
IEEE
13 years 12 months ago
1998
IEEE
We compare two (apparently) rather different set-based constraint languages, and we show that, in spite of their different origins and aims, there are large classes of constraint ...
IJAC
2008
13 years 7 months ago
2008
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
ECCV
2000
Springer
14 years 9 months ago
2000
Springer
Abstract. This paper presents anovel variational method forimage segmentation that uni es boundary and region-based information sources under the Geodesic Active Region framework. ...
CSR
2006
Springer
13 years 11 months ago
2006
Springer
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
BIRTHDAY
2004
Springer
14 years 1 months ago
2004
Springer
We give faster algorithms for two methods of reducing the number of states in nondeterministic finite automata. The first uses equivalences and the second uses preorders. We deve...