![]() ![]() Nondeterminism means that when the algorithm is faced with multiple choices for what to do next, it does them all “at the same time”. In the algorithm, two points were labeled as “nondeterministic choices”. ![]() Follow the transition to the next state (updating current state).Įxample: for the following finite automaton:Ĭauses the algorithm to traverse the statesīecause the input tape is empty when the algorithm reaches state 4 (an accepting state), the string is accepted. The input string is rejected and the algorithm terminatesĬhoose a transition labeled with a symbol matching the one under the tape head. If the current state has no transition labeled with a symbol matching the symbol under the tape head: If the current state is not an accepting state, then the input string is rejected and the algorithm terminates If the current state is an accepting state, then the input string is accepted and the algorithm terminates If there are no more symbols to be read from the tape:
0 Comments
Leave a Reply. |