Computer Science 172 - Fall 1995 - Sinclair - Midterm 1

Computer Science 172 - Fall 1995 - Sinclair - Midterm 1 -...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Quiz 1 Quiz 1 CS 172: Computability and Complexity, Fall ’95 11am-12:30pm, 25 October Notes: There are three questions on this quiz. Please answer each question in the space below it, using the back of the sheet to continue your answer if necessary. Please write clear, concise answers. If you are having problems with part of a question, leave it and try the next one. _________________________________________________________________________________ 1. (a) Which of the following languages are regular? If the language is regular, provide a finite automaton or a regular expression for it. If not, give a proof using the pumping lemma. i. The set of all 0-1 strings that contain either the substring 000 or the substring 111 (or both). ii. The language {0 i 1 j 2 k : i = j or j = k}. iii. The set of all 0-1 strings of the form 0 i 1 j , where i is odd and j is even. (b) Give a context free grammar for each of the language in part (a)....
View Full Document

This note was uploaded on 05/17/2009 for the course CS 172 taught by Professor Seshia during the Spring '08 term at Berkeley.

Page1 / 2

Computer Science 172 - Fall 1995 - Sinclair - Midterm 1 -...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online