Define a NDFA with and example

23views

written 9.4 years ago by

teamques10 ★ 70k

When machine is in a given state and reads asymbol, the machine will have a choice ofwhere to move to next.
There may be states where, after reading a givensymbol, the machine has nowhere to go.
Applying the transition function will give, not just a single state, but zeroormorestates

Example: …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT