Build finite automata with alphabet {0, 1} to recognise a) the language of strings that have three consecutive 0s; b) the language of strings that do not have three consecutive 1s. Describe a finite...

Build finite automata with alphabet {0, 1} to recognise

a) the language of strings that have three consecutive 0s;

b) the language of strings that do not have three consecutive 1s.

Describe a finite automaton that recognises words over the alphabet

{a, b, c} with an odd number of symbols and such that they do not contain

aa or bb.