Member Avatar for annitaz

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

  • 3 Contributors
  • 8 Replies
  • 97 Views
  • 1 Day Discussion Span
  • Latest Post Latest Post by apines
Member Avatar for theonly

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.

Member Avatar for annitaz

the regular expression for this is a*b*?

The FA I came up is attached

notba.docx (10.72 KB)
Edited by annitaz because: n/a
Member Avatar for apines

Regarding the regular expression - you are correct.

Member Avatar for annitaz

what about the FA?

Member Avatar for annitaz

what about the FA?

Member Avatar for apines

Attached is the NFA I've came up with.

nfa.jpg 21.09 KB
Member Avatar for annitaz

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

Member Avatar for apines

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.