Abstract
The Nth linear complexity of a sequence is a measure of predictability. Any unpredictable sequence must have large Nth linear complexity. However, in this paper we show that for q-automatic sequences over Fq the converse is not true.We prove that any (not ultimately periodic) q-automatic sequence over Fq has Nth linear complexity of order of magnitude N. For some famous sequences including the Thue–Morse and Rudin–Shapiro sequence we determine the exact values of their Nth linear complexities. These are non-trivial examples of predictable sequences with Nth linear complexity of largest possible order of magnitude.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
