CS 360 Introduction to the Theory of Computing
Spring 2015
Assignment 2
Student: Arun Gandikota (aggandik)
Due: Thursday, June 11 at 4:00pm
1. [6 points] Give a context-free grammar for each of the following languages. You do not need
to prove that your g
Lab 9: Processing two lists
Create a separate le for each question. Keep them in your Labs folder, with the name liqj for Lab , Question . Download the headers for each function from the le labinterface9.rkt linked off the Labs page on the course Web site
CS 360 Introduction to the Theory of Computing
Quiz 1
Friday, May 25, 2007
You have 45 minutes to complete this quiz.
No books, notes, calculators, or other aids are permitted.
Please write your answers directly in this booklet, and use the backs of pa
CS 360 Introduction to the Theory of Computing
Quiz 3 Solutions
1. (a) State the Pumping Lemma for context-free languages.
Solution. For every context-free language A, there exists a pumping length n 1 such
that the following property holds. For every str
CS 360 Introduction to the Theory of Computing
Quiz 2
Friday, June 15, 2007
You have 45 minutes to complete this quiz.
No books, notes, calculators, or other aids are permitted.
Please write your answers directly in this booklet, and use the backs of p
CS 360 Introduction to the Theory of Computing
Quiz 3
Friday, July 6, 2007
You have 45 minutes to complete this quiz.
No books, notes, calculators, or other aids are permitted.
Please write your answers directly in this booklet, and use the backs of pa
Exercise 4.2.6
Show that the regular languages are closed under the operations below. For each, well start with L and apply operations under which regular languages are closed (homomorphisms, intersection, set dierence) to get the desired language. a) min
CS 360 Assignment 2
1. We assume towards a contradiction that A is regular. Then, due to the Pumping
Lemma, there exists a pumping length n 1 such that every string s A of length at
least n can be written as s = xyz, satisfying the following three conditi
CS 360 Introduction to the Theory of Computing
Spring 2007
Assignment 1 Solutions
1. [12 points] Give a DFA that recognizes the language
L1 = cfw_w cfw_a, b, c : every c in w is immediately preceded by aa.
For example: the strings aab, baaca, and are in L