4 search results - page 1 / 1 » Bifix codes and Sturmian words |
8
Voted
CORR
2010
Springer
13 years 2 months ago
2010
Springer
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We say x {0, 1, 2}N is a word with Sturmian erasures if for any a {0, 1, 2} the word obtained erasing all a in x is a Sturmian word. A large family of such words is given coding ...
TCS
2002
13 years 5 months ago
2002
We show that the coding of a rotation by on m intervals can be recoded over m Sturmian words of angle . c 2002 Elsevier Science B.V. All rights reserved.
CAI
2009
Springer
13 years 3 months ago
2009
Springer
This paper studies conditions under which the operation of parallel insertion can be reversed by parallel deletion, i.e., when does the equality (L1 L2) L2 = L1 hold for language...