Abstract
The problem percolation of words arises in the 80's with the interest in observingalternating sequences (1, 0, 1, 0, 1, 0, 1, 0, ¿ ) in graphs with randomness in sites. In 1995,Itai Benjamini and Harry Kesten formalized the problem of see all words in a graphin Percolation of Arbitrary Words in {0, 1}¿ and showed some results and counterexamples, as well as presenting problems. One of the…