Question 01

Design a deterministic finite automaton to read strings of 0s and 1s, and determine if the sequence read so far has even parity (i.e., there have been an even number of 1s).

Question 02

Design a deterministic finite automaton to read strings that end with aba, given

Question 03

Design a nondeterministic finite automaton for the problem stated at question 02.

Question 04

Design a deterministic finite automaton to read strings that do not contain consecutive as or bs, given For example, a set of accepted strings will be {a, b, ba, ab, aba, bab, .}

a, b c