Consider the alphabet {0, 1}. Describe (graphically or formally) a) a finite automaton that recognises the language of the strings of 0s of any length; b) a finite automaton that recognises the...

Consider the alphabet {0, 1}. Describe (graphically or formally)

a) a finite automaton that recognises the language of the strings of 0s of

any length;

b) a finite automaton that recognises the language of the strings of 0s and

1s that contain a 1 in the second position;

c) a finite automaton that recognises the language of the strings of 0s and

1s that start and finish with 00 and do not contain 11.