516 search results - page 35 / 104 » Sets of k-Independent Strings |
STACS
2007
Springer
14 years 1 months ago
2007
Springer
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
CPC
2008
13 years 7 months ago
2008
We analyze the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . . , d}. The edges receive random weights whose distr...
CSJM
2008
13 years 7 months ago
2008
A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with an evolutionary processor (a special rewriting system), a set of words, an inpu...
CIMCA
2006
IEEE
14 years 1 months ago
2006
IEEE
A junction based approach for Segmenting and recognizing offline handwritten connected twodigit strings is presented in this paper. Very often even in a printed text, adjacent cha...