CSC 320 Midterm: CSC 320 UVic Midterm98

• School: University of Victoria
• Department: Computer Science
• Course: CSC 320
• Professor: All

Document Summary

[20 marks] use the construction described in class (which is the same as the one in the text) to convert this ndfa to an equivalent dfa: a e s a b u t e v b. A picture of your nal dfa: circle true or false and justify your answer. No marks will be given unless there is a correct justi cation. [5 marks] the set {l : l is a regular language over = {a, b, c}} is count- able. [5 marks] every subset of a regular language is regular. [5 marks] regular languages are closed under difference. Design a dfa for the strings in l1. = {w {0, 1}* : w ends with 0}. = {w {0, 1}* : the number of 1 s in w is not divisible by 3}. [20 marks] give a context-free grammar for l = {an bm cn+m : n, m 0}.