Back to Search
Start Over
On factors of synchronized sequences
- Source :
-
Theoretical Computer Science . Oct2010, Vol. 411 Issue 44-46, p3932-3937. 6p. - Publication Year :
- 2010
-
Abstract
- Abstract: Let be an integer. A sequence of natural numbers is -synchronized if its graph is represented, in base , by a right-synchronized rational relation. We show that the factor complexity and the palindromic complexity of a -synchronized sequence are -regular sequences. We derive that the palindromic complexity of a -automatic sequence is -automatic. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 411
- Issue :
- 44-46
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 54106160
- Full Text :
- https://doi.org/10.1016/j.tcs.2010.08.005