1 votes 1 votes Input Alphabet ={0,1}, construct a finite automata (preferably dfa) for a language containing set of all strings such that every block of 5 consecutive symbols contain at least 2 zeroes. Theory of Computation theory-of-computation finite-automata minimal-state-automata + – aditya kuppa 1 asked Jul 11, 2017 aditya kuppa 1 323 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.