patternModerate
How does the NFA decide in a state where there are multiple equally valid "next states"?
Viewed 0 times
theequallynfaarewherestatesnextdecidedoeshow
Problem
How does the NFA decide in a state where there are multiple equally valid "next states"?
Such as here:
How does it decide on which state it takes to with 1?
Such as here:
How does it decide on which state it takes to with 1?
Solution
It doesn't decide. Nondeterminism isn't intended to be a realistic model of computation. Check the definition: a nondeterministic automaton accepts if there's any valid sequence of transitions that reach an accepting state.
Context
StackExchange Computer Science Q#51163, answer score: 12
Revisions (0)
No revisions yet.