Designing preference functions for de Bruijn sequences with forbidden words

DOI10.1007/s10623-022-01077-5OpenAlexW4286817135WikidataQ114849697 ScholiaQ114849697MaRDI QIDQ2673980

Abbas Alhakim

Publication date: 22 September 2022

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-022-01077-5

zbMATH Keywords

de Bruijn sequenceFord sequencepreference functionforbidden words

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spans of preference functions for de Bruijn sequences
• A note on certain de Bruijn sequences with forbidden subsequences
• de Bruijn sequences and de Bruijn graphs for a general language
• Universal cycles for combinatorial structures
• Equivalence class universal cycles for permutations
• On extending de Bruijn sequences
• Binary de Bruijn cycles under different equivalence relations
• Investigating the discrepancy property of de Bruijn sequences
• Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions
• Generalized de Bruijn words for primitive words and powers
• A Simple Combinatorial Algorithm for de Bruijn Sequences
• De Bruijn Sequences for the Binary Strings with Maximum Density
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Constructing Orthogonal de Bruijn Sequences
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Designing preference functions for de Bruijn sequences with forbidden words