14 search results - page 1 / 3 » Binary Words Containing Infinitely Many Overlaps |
COMBINATORICS
2006
13 years 11 months ago
2006
We characterize the squares occurring in infinite overlap-free binary words and construct various power-free binary words containing infinitely many overlaps.
LPAR
2010
Springer
13 years 8 months ago
2010
Springer
We introduce parameterized rewrite systems for describing infinite families of finite string rewrite systems depending upon non-negative integer parameters, as well as ways to reas...
LATA
2010
Springer
14 years 3 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
TCS
2008
13 years 10 months ago
2008
We prove that it is decidable whether a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple ...
WWW
2009
ACM
14 years 11 months ago
2009
ACM
Transferring knowledge from one domain to another is challenging due to a number of reasons. Since both conditional and marginal distribution of the training data and test data ar...