513 search results - page 38 / 103 » Finitely Based, Finite Sets of Words |
103
click to vote
CORR
2010
Springer
14 years 12 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...
DCC
2007
IEEE
15 years 11 months ago
2007
IEEE
The aim of this paper is to present a construction of t-divisible designs for t > 3, because such divisible designs seem to be missing in the literature. To this end, tools suc...
106
click to vote
SIAMCOMP
2000
14 years 11 months ago
2000
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
FOCS
1993
IEEE
15 years 4 months ago
1993
IEEE
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
107
click to vote
ICPR
2006
IEEE
16 years 28 days ago
2006
IEEE
We introduce a shape descriptor that is based on the Symmetry Set. This set represents pairwise symmetric points and consists of several branches. The begin and end points of the ...