Minimizing positive integer sequences without duplicate substrings

MaRDI QIDQ4643377zbMATH OpenFDO

Authors

Publication date 24 May 2018

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Algorithms on strings (68W32)

Recommendations

• Further results on minimizing positive integer sequences without duplicate substrings
• Expected Number of Distinct Subsequences in Randomly Generated Binary Strings
• Some generalizations on counting binary strings
• Minimum unique substrings and maximum repeats
• Minimal partial languages and automata

Cited in

(2)

• Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
• Further results on minimizing positive integer sequences without duplicate substrings

This page was built for publication: Minimizing positive integer sequences without duplicate substrings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4643377)