Perfect necklaces

DOI10.1016/j.aam.2016.05.002zbMath1386.68119arXiv1601.07975OpenAlexW2911532181MaRDI QIDQ308973

Pablo A. Ferrari, Verónica Becher, Sergio A. Yuhjtman, Nicolás Alvarez

Publication date: 6 September 2016

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

combinatorics on wordsnecklacesde Bruijn wordsstatistical tests of finite size

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (4)

Insertion in constructed normal numbers ⋮ Automatic Kolmogorov complexity, normality, and finite-state dimension revisited ⋮ Extending de Bruijn sequences to larger alphabets ⋮ Normal numbers and nested perfect necklaces

Uses Software

• TestU01

Cites Work

• The origins of combinatorics on words
• On extending de Bruijn sequences
• Fisher, Neyman, and the Creation of Classical Statistics
• Algorithmic Randomness and Complexity
• TestU01
• Automatic Sequences
• The Construction of Decimals Normal in the Scale of Ten
• The definition of random sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfect necklaces