On the \(N\)th linear complexity of automatic sequences
DOI10.1016/j.jnt.2017.11.008zbMath1416.11042arXiv1711.10764OpenAlexW2962853512MaRDI QIDQ1747239
Publication date: 4 May 2018
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.10764
continued fractionautomatic sequencepattern sequencepaper-folding sequenceBaum--Sweet sequencelattice profilelinear complexity, expansion complexityRudin--Shapiro sequenceShapiro sequencesum-of-digits sequence
Number-theoretic algorithms; complexity (11Y16) Continued fractions (11A55) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Automata sequences (11B85)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Expansion complexity and linear complexity of sequences over finite fields
- On the joint linear complexity profile of explicit inversive multisequences
- Linear complexity profile and correlation measure of interleaved sequences
- Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
- On finite pseudorandom binary sequences. II: The Champernowne, Rudin-Shapiro, and Thue-Morse sequences, a further construction
- Finite automata and arithmetic
- Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
- Linear complexity profile of binary sequences with small correlation measure
- Modular constructions of pseudorandom binary sequences with composite moduli
- Counting functions and expected values for the lattice profile at \(n\)
- Subsequences of automatic sequences and uniform distribution
- Some Notes on the Two-Prime Generator of Order<tex>$2$</tex>
- Suites algébriques, automates et substitutions
- Automatic Sequences
- On the use of expansion series for stream ciphers
- Progress in Cryptology - INDOCRYPT 2003
This page was built for publication: On the \(N\)th linear complexity of automatic sequences
