On the maximum number of distinct factors of a binary string

DOI10.1007/BF02988306zbMath0779.05028OpenAlexW2034329734MaRDI QIDQ2366959

Jeffrey O. Shallit

Publication date: 11 August 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02988306

zbMATH Keywords

factorDe Bruijn graph

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

Uniform words ⋮ Sublinear algorithms for approximating string compressibility ⋮ Subsequence frequency in binary words ⋮ On semi-perfect de Bruijn words ⋮ On average sequence complexity ⋮ On the combinatorics of finite words ⋮ Complexity for finite factors of infinite sequences ⋮ Total palindrome complexity of finite words ⋮ Maximal state complexity and generalized de Bruijn words

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial theory seminar Eindhoven University of Technology
• Binary Ring Sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Normal Recurring Decimals

This page was built for publication: On the maximum number of distinct factors of a binary string