SOLVED: 3. a) Construct a deterministic finite state automaton that recognizes the set of bit strings that do not contain two consecutive Os. b) Define a regular grammar that generates the set of all bit strings that contain no Os and an odd number of 1s. c) Write a regular expression that describes the set of bit strings ending with a 0 and not containing 11.

SOLVED:Find a deterministic finite-state automaton that recognizes the same language as the nondeterministic finite-state automaton in Exercise 44 .