COMP 335 Study Guide - Final Guide: Regular Language, Regular Expression, Moodle

• School: Concordia University
• Department: Computer Sci.
• Course: COMP 335
• Professor: Nematollaah Shiri

Document Summary

Comp 335 introduction to theoretical computer science. Submission through moodle is extended to: september 27th 30th at 23:55. That means, while the what is important, the why is absolutely essential. Show the steps of your solution for the full mark. Total mark is 70 60: [10 points] let r and l be any languages over an alphabet . L = {anbn+1 : n 0}: [10 points] this question is being moved from this homework to hw2. Let l be any regular language over an alpgabet . Using l, we de ne the language: chop(l) = {w : x, y, z , xyz l, w = xz}. Show that chop(l) is regular whenever l is regular. [10 points] give a fa for l = l1 l3, where l1 and l3 are languages de ned in question 3 above.