Generation of binary words avoiding alternating patterns
Stefano Bilotta, Elisabetta Grazzini, Elisa Pergola, Renzo Pinzani

TL;DR
This paper presents an algorithm to generate all binary words with a fixed number of 1's, avoiding specific alternating patterns, and proves its exhaustiveness.
Contribution
The paper introduces a novel algorithm that exhaustively generates binary words with constraints on pattern avoidance and fixed number of 1's.
Findings
Algorithm is exhaustive in generating all such binary words
All generated words avoid the pattern $(10)^j1$ for any fixed $j \\geq 1$
The method ensures no valid words are missed
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 for any fixed . We will prove that this generation is exhaustive, that is, all such binary words are generated.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · semigroups and automata theory · DNA and Biological Computing
