Extending de Bruijn sequences to larger alphabets

DOI10.1016/J.IPL.2020.106085OpenAlexW3118347590MaRDI QIDQ2656349

Verónica Becher, Lucas Cortés

Publication date: 11 March 2021

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial problemsgraph algorithmsde Bruijn sequencesEulerian cyclemaximum flow

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Insertion in constructed normal numbers

Cites Work

• Unnamed Item
• Perfect necklaces
• The origins of combinatorics on words
• An efficient shift rule for the prefer-max de Bruijn sequence
• On semi-perfect de Bruijn words
• On extending de Bruijn sequences
• Normal numbers and nested perfect necklaces
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• On the discrepancy estimate of normal numbers

This page was built for publication: Extending de Bruijn sequences to larger alphabets