254 search results - page 5 / 51 » Binary amiable Words |
DLT
2008
13 years 11 months ago
2008
Abstract. Let w be an equality word of two nonperiodic binary morphisms g, h : {a, b} . Suppose that no overflow occurs twice in w and that w contains at least 9 occurrences of a ...
LATA
2010
Springer
14 years 28 days ago
2010
Springer
The problem of classifying all the avoidable binary patterns in words has been completely solved (see Chapter 3 of M. Lothaire, Algebraic Combinatorics on Words, Cambridge Universi...
TAMC
2010
Springer
14 years 1 months ago
2010
Springer
In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity functi...
CIKM
2009
Springer
14 years 1 months ago
2009
Springer
We describe an efficient technique to weigh word-based features in binary classification tasks and show that it significantly improves classification accuracy on a range of proble...
CPM
2008
Springer
13 years 11 months ago
2008
Springer