Generation of binary words avoiding alternating patterns
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.