CPSC 313 Lecture Notes - Regular Expression
Document Summary
Any language l that accepts a regular expression r is regular. A gnfa n accepts a string w, if there is a walk from the start-state of n to a. Nal state of n , that is labeled with a regular expression r, usch that w l(r). Example: insert image from regular languages notes (3. 12). The above gnfa accepts the language l(a (a + b)c ). Every nfa n is a gnfa that accepts the language l(n ). W. l. o. g gnfas have exactly one nal state, and the nal state is not the initial state. (make all nal states non- nal ones, and add -transitions to a new nal state. ) W. l. o. g gnfas are complete, i. e. , have edges between any two verticies (add.