Solution Found!
Let D = {w
Chapter , Problem 1.12(choose chapter or problem)
QUESTION:
Let D = {w| w contains an even number of as and an odd number of bs and does not contain the substring ab}. Give a DFA with ve states that recognizes D and a regular expression that generates D. (Suggestion: Describe D more simply.)
Questions & Answers
QUESTION:
Let D = {w| w contains an even number of as and an odd number of bs and does not contain the substring ab}. Give a DFA with ve states that recognizes D and a regular expression that generates D. (Suggestion: Describe D more simply.)
ANSWER:Step 1 of 3
Let us consider the language contains an even number of and an odd number of and does not contain the substring.
The language can be described as:
contains an odd number of followed by even number of.