CS381 First Mid Term Friday Sept 23, 2005 Fall 2005 Olin 155 9:05-9:55 This is a 50-minute in class closed book exam. All questions are straightforward and you should have no trouble doing them. Please show all work and write legibly. Thank you. 1. Let ()111011,,,,MQqFδ=Σand ()222022,,,,MQqFδ=Σbe finite automata. Construct a finite automaton M that accepts the language ()()1122LMLMI. 2. Write a regular expression denoting the set of all strings of 0’s and 1’s such that every 1 is immediately preceded by at least two consecutive 0’s. Suggestion: To make sure your answer is correct ask yourself some simple questions such as does your expression work for
This is the end of the preview.
access the rest of the document.