CS 360- Final Exam Guide - Comprehensive Notes for the exam ( 34 pages long!)

• School: University of Waterloo
• Department: Computer Science
• Course: CS360
• Professor: Richard Trefler

Document Summary

There exist a integer of length n ( pumping length ) such. A={ omim : mzo is not regular . For any w= xyz y = ok for. { we ex : w= wr ] for. Aab regular is regular is is regular regular. It are non regular languages , is it true. ) a* is non regular ? liv ) W={ ( i ) i lii ) w= of w is wr ez* such that reverse. B) v ( w 4 a a web ) } { xez prefix ( a) suffix of a ez* I uez* s . t ux e a } The substring of a c- e* is substring (a) Then ( i ) prefix ca ) ( ii ) suffix (a) , and liii ) substring la ) are regular languages. Idea alphabet and let r be a regular expression over. R , and rz are regular expressions and assuming that.