A note on certain de Bruijn sequences with forbidden subsequences

DOI10.1016/J.DISC.2009.10.009MaRDI QIDQ965982zbMATH OpenOpenAlexFDO

Authors Rudi Penne

Publication date 27 April 2010

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2009.10.009

zbMATH Keywords

de Bruijn sequenceline graphEulerian digraph

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• de Bruijn sequences and de Bruijn graphs for a general language
• De Bruijn sequences with varying combs
• An unoriented variation on de Bruijn sequences
• ``Periods of de Bruijn sequences
• scientific article; zbMATH DE number 2192127

Cites work

• scientific article; zbMATH DE number 1696649 (Why is no real title available?)
• scientific article; zbMATH DE number 3882430 (Why is no real title available?)
• scientific article; zbMATH DE number 4021187 (Why is no real title available?)
• scientific article; zbMATH DE number 3675952 (Why is no real title available?)
• An affective mobile robot educator with a full-time job
• Eulerian iterated line graphs and digraphs
• Paths and cycles in matroid base graphs
• de Bruijn sequences and de Bruijn graphs for a general language

Cited in

(4)

• Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
• Designing preference functions for de Bruijn sequences with forbidden words
• Independently prescribable sets of n-letter words
• Further results on minimizing positive integer sequences without duplicate substrings

This page was built for publication: A note on certain de Bruijn sequences with forbidden subsequences

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