unknown

On factors of synchronized sequences

Abstract

AbstractLet 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

Similar works

Full text

thumbnail-image
Last time updated on 28/04/2017

This paper was published in Elsevier - Publisher Connector .

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.