论文信息 - Generation of binary words avoiding alternating patterns

Generation of binary words avoiding alternating patterns

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 \geq 1$. We will prove that this generation is exhaustive, that is, all such binary words are generated.

[1] Andrew Odlyzko,et al. Long repetitive patterns in random sequences , 1980 .

[2] Leonidas J. Guibas,et al. String Overlaps, Pattern Matching, and Nontransitive Games , 1981, J. Comb. Theory A.

[3] Philippe Flajolet,et al. An introduction to the analysis of algorithms , 1995 .

[4] Philippe Flajolet,et al. Hidden word statistics , 2006, JACM.

[5] Alberto Del Lungo,et al. ECO:a methodology for the enumeration of combinatorial objects , 1999 .

[6] S. Corteel,et al. Séries génératrices exponentielles pour les ECO-systèmes signés , 2000 .

[7] Eugene H. Spafford,et al. A PATTERN MATCHING MODEL FOR MISUSE INTRUSION DETECTION , 1994 .

[8] Mikhail J. Atallah,et al. Compact Recognizers of Episode Sequences , 2002, Inf. Comput..

[9] Renzo Pinzani,et al. Jumping succession rules and their generating functions , 2003, Discret. Math..

[10] Stefano Bilotta,et al. Binary words avoiding a pattern and marked succession rule , 2011, ArXiv.