381prelim1_FA05 - CS381 Fall 2005 First Mid Term Friday...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
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 () 11 1 0 1 1 ,, , , M Qq F δ and ( ) 22 2 0 2 2 M F be finite automata. Construct a finite automaton M that accepts the language 2 2 LM LM I . 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
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/25/2007 for the course COM S 381 taught by Professor Hopcroft during the Fall '05 term at Cornell University (Engineering School).

  • Fall '05
  • HOPCROFT
  • Formal language, Regular expression, Nondeterministic finite state machine, Automata theory, Olin, 50-minute
Ask a homework question - tutors are online