Rational series and their languages
Rational series and their languages
The ring of k-regular sequences
Theoretical Computer Science
Synchronized rational relations of finite and infinite words
Theoretical Computer Science - Selected papers of the International Colloquium on Words, Languages and Combinatorics, Kyoto, Japan, August 1990
Automata, Languages, and Machines
Automata, Languages, and Machines
Theoretical Computer Science
The ring of k-regular sequences, II
Theoretical Computer Science - WORDS
On relations defined by generalized finite automata
IBM Journal of Research and Development
Enumeration and decidable properties of automatic sequences
DLT'11 Proceedings of the 15th international conference on Developments in language theory
| Hi-index | 5.23 |
Let k=2 be an integer. A sequence of natural numbers is k-synchronized if its graph is represented, in base k, by a right-synchronized rational relation. We show that the factor complexity and the palindromic complexity of a k-synchronized sequence are k-regular sequences. We derive that the palindromic complexity of a k-automatic sequence is k-automatic.