6 search results - page 2 / 2 » Unbordered factors and Lyndon words |
TCS
2008
13 years 6 months ago
2008
In this paper, we consider smooth words over 2-letter alphabets {a, b}, where a, b are integers having same parity, with 0 < a < b. We show that all are recurrent and that t...