On the pseudorandomness of automatic sequences

DOI10.1007/s12095-017-0260-7zbMath1419.11101arXiv1710.03026OpenAlexW2761463937MaRDI QIDQ1667443

László Mérai, Arne Winterhof

Publication date: 28 August 2018

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.03026

zbMATH Keywords

finite automatonThue-Morse sequenceautomatic sequencesstate complexitycorrelation measurepseudorandom sequences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Algebraic theory of languages and automata (68Q70) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (2)

On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values ⋮ Pseudorandom sequences derived from automatic sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Counting functions and expected values for the lattice profile at \(n\)
• Subsequences of automatic sequences and uniform distribution
• The Probabilistic Theory of Linear Complexity
• Suites algébriques, automates et substitutions
• On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
• Automatic Sequences
• Linear Complexity and Expansion Complexity of Some Number Theoretic Sequences
• Measures of pseudorandomness for finite sequences: typical values

This page was built for publication: On the pseudorandomness of automatic sequences