Let D = {w

Chapter , Problem 1.12

(choose chapter or problem)

Get Unlimited 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.)

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.

Add to cart


Study Tools You Might Need

Not The Solution You Need? Search for Your Answer Here:

×

Login

Login or Sign up for access to all of our study tools and educational content!

Forgot password?
Register Now

×

Register

Sign up for access to all content on our site!

Or login if you already have an account

×

Reset password

If you have an active account we’ll send you an e-mail for password recovery

Or login if you have your password back