Question: Construct a Deterministic Finite Automata whose language is the set of strings over {a, b} in which every symbol in an odd position is a.
Construct a Deterministic Finite Automata whose language is the set of strings over {a, b} in which every symbol in an odd position is a. (For example, aaa, ababab, and aaaba are in the language. baa is not (position 1 is not a) and aabaa is not (position 3 is not a).
Explicitly state the set of strings which terminates at each state.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
