CS 4510 Lecture 4: Nondeterminism
Document Summary
Lecture four hondetermlhlsm - atvahge , impractical? ) There is a defined transition for every symbol in the alphabet . H what about ahoudetlivnimstie fa ? ( nfa) 2dl "5hhct differences . Can go to movie than one state in a transition state. E - alls - rules involving eas an option a q a. 91 sees a 1. can go to 2 states by " guessing" which way to go . 92 sees 1 but goes nowhere chuck) ,-92 sees e & goes. Transition table put o computation of n, onthe string when there"s more. E a:[ i. i } tuna:p f. " a than one possibility for the transition. Nondeterministic fa accept only regular languages . (cid:8869) good for proving languages are regular b/c nfa"s are amaker & simpler . 010110 because atleast one option accepts the awing ! this is "guessing " ! ) Y take a language consisting of all strings in e.