2 search results - page 1 / 1 » A connection between palindromic and factor complexity using... |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...
SIAMCOMP
2000
13 years 4 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...