Generation of binary words avoiding alternating patterns

2012/10/29 by Stefano Bilotta, Elisabetta Grazzini, Bilotta, Stefano +5
Biochemistry, Genetics and Molecular Biology · Computer Science · #05A05 #05A15 #Algorithms and Data Compression #Combinatorics (math.CO) #DNA and Biological Computing #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1210.7620

openalex publication_date 2012/10/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we propose an algorithm to generate binary words with no more 0's than 1's having a fixed number of 1's and avoiding the pattern (10)^j1 for any fixed j ≥ 1. We will prove that this generation is exhaustive, that is, all such binary words are generated.

Related

• Binary words avoiding a pattern and marked succession rule
• Words restricted by patterns with at most 2 distinct letters
• Binary words avoiding xx^Rx and strongly unimodal sequences
• Binary words containing infinitely many overlaps
• Finite automata and pattern avoidance in words