build an FA that accepts the language of words tha do not contain the substring ba

Recommended Answers

All 8 Replies

Are you even going to try to do this yourself. This is a simple problem. If you are looking for the answer without trying to do this yourself you will be struggling later on in the class.

the regular expression for this is a*b*?

The FA I came up is attached

Regarding the regular expression - you are correct.

what about the FA?

what about the FA?

Attached is the NFA I've came up with.

Is this correct? There are no start and final states and also each state should read an a and b string

Sorry forgot about the start - the left state is the starting state, and as you can see the final state is the right one - you cannot get out of it once in there.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.