A note on bifix-free sequences (Corresp.)

DOI10.1109/TIT.1973.1055065zbMath0278.94009MaRDI QIDQ4404777

P. Tolstrup Nielsen

Publication date: 1973

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (24)

A strong non-overlapping Dyck code ⋮ Avoiding cross-bifix-free binary words ⋮ Non-overlapping matrices via Dyck words ⋮ Automatic Theorem-Proving in Combinatorics on Words ⋮ Cross-bifix-free sets generation via Motzkin paths ⋮ Non-expandable non-overlapping sets of pictures ⋮ On Maximal Unbordered Factors ⋮ Unbordered Pictures: Properties and Construction ⋮ Counting the palstars ⋮ Ranking and unranking bordered and unbordered words ⋮ Smallest and Largest Block Palindrome Factorizations ⋮ Inverse star, borders, and palstars ⋮ Unnamed Item ⋮ Avoidance of split overlaps ⋮ Prefix partitioned Gray codes for particular cross-bifix-free sets ⋮ Borders, palindrome prefixes, and square prefixes ⋮ The word problem for one-relation monoids: a survey ⋮ AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS ⋮ On the Number of Unbordered Factors ⋮ Cross-bifix-free sets in two dimensions ⋮ Counting bordered and primitive words with a fixed weight ⋮ Non-overlapping matrices ⋮ Sets of Pictures Avoiding Overlaps ⋮ Density of \(k\)-ary words with 0, 1, 2-error overlaps

This page was built for publication: A note on bifix-free sequences (Corresp.)