Please solve this deterministic finite automaton (DFA) exercise?

LmAN

New member
Please someone help me to solve this exercise

Give DFA;s accepting the following languages over the alphabet {0,1}:

(a) The set of all strings such that each block of five consecutive symbols contains at least two 0's

(b) The set of all strings whose tenth symbol from the right end is a 1
 
Back
Top