Member Avatar for Den Watts
Den Watts 0 Newbie Poster

Hey people, I need help with this one:

build a finite NON deterministic automata that accept the next language:

language of all the words on {0,1,2} from the form: w=w1w2w3 that keep:
w1 belongs to 0*
w2 belongs to 1*
w3 belongs to 2*
|w| is even

thank you !

  • 1 Contributor
  • 0 Replies
  • 83 Views
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.