CS 271: Automata and Computation Theory
Spring 2015
Problem Set #2 Solutions
Problem 1 Give a CFG that generates each of the following languages. For each variable
in your CFG, describe the set of str
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 1
Due: Thursday, September 8th at 11:00pm. No late work accepted.
Be sure that each problem part/subpart is labeled with its num
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 9
Due: Thursday, December 1st at 11:00pm. No late work accepted.
Please complete your work for a single problem on its own page.
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 8 SOLUTIONS
1. Define the unary language operation called dagger on any arbitrary language L as follows. If L
has alphabet = cfw
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 7
Due: Tuesday, November 1st at 11:00pm. No late work accepted.
Please complete your work for a single problem on its own page.
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 5 Solutions
1. Give the state diagram for a pushdown automaton that recognizes the following language:
L1 = cfw_ ai bj ck | i, j
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 10
Due: Friday, December 9th at 11:00pm. No late work accepted.
Please complete your work for a single problem on its own page.
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 3 Solutions
1. We aim to prove the following claim: If any language L is regular, then HasProperPrefix(L) is
also regular. So we
600.271: Automata and Computation Theory, Fall 2017
Midterm 1 Tuesday, September 26th
Name (print): ngb A 8910\th JHED ID:
( 5w: E)
Academic Integrity Pledge.
"I agree to complete this exam without
601.231: Automata and Computation Theory, Fall 2017
Practice Problems, Section 1.1 SOLUTIONS [contributed by Yi (Ethan) Lee]
(A) The following are the state diagrams of two DFAs, M1 and M2 . Answer th
600.231: Automata and Computation Theory, Fall 2017
Midterm 2 - Thursday. October 19th
_-
Name (print): JHED ID:
SOLUTION
Academic Integrity Pledge.
I agree to complete this exam without unauthorized
601.231: Automata and Computation Theory, Fall 2017
Practice Problems, Section 1.3 SOLUTIONS [contributed by Yi (Ethan) Lee]
(A) Give regular expressions generating the lanuages of Exercise 1.6.
a. cf
601.231: Automata and Computation Theory, Fall 2017
Homework Assignment 5
Due: Tuesday, November 14th at 11:00pm. No late work accepted.
Be sure that each problem part/subpart is labeled with its numb
601.231: Automata and Computation Theory
Practice Problems, Section 1.4 SOLUTIONS
(A) Sipser 1.29 b (and also a and c)
SOLUTIONS for parts a) and c) are provided in the Sipser text.
b) Use the Pumping
Qaieckd Emu/ha, ()rmbtzm Sgkhm; 64-9/me 4. am
I (Etna/U VJ DECIDABLLF L/wM/mezr ?
(A) 9pm Lu - sce 50mm M mama
Non/n+3 TM M +0 wok. L; Wants:
\ w cfw_Dik7e L #6 Muow awh
-. '9? (3135; L Hm MCDIKb) Mad
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 4
Due: Tuesday, October 11th at 11:00pm. No late work accepted.
Please complete your work for a single problem on its own page.
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 7 SOLUTIONS
Please complete your work for a single problem on its own page. All subparts of the same problem
should appear on th
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 5
Due: Tuesday, October 18th at 11:00pm. No late work accepted.
Please complete your work for a single problem on its own page.
Homework 6 Solutions
Professor Xin Li
Head CA: Ryan Marten
EN.6(I).271 - Automate and Computation Theory
May 8, 2017
1
(20 points)Showthst thelangungALTisNP-hsrd. Isit NP-oomplete?
Notethstspmblelnili
Professor Xin Li
Head CA: Ryan Marren
EN .600.271 - Automate and Computation Theory
March 31, 2017
1
(20 points) Show that the class of contact-free languages is closed under the star operation
(recal
Homework 2 Solutions
Professor Xin Li
Head CA: Ryan Marten
EN.600.271 - Automata and Computation Theory
February 24, 2017
1
(20mm) GiveanNFAMnstmdiagamandnformaldescription)moogzingthe
language? witht
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 2 Solutions
1. (a) Solution: F = cfw_q2
(b) Solution: (q0 , a) = (there is no defined transition on a from q0 )
(c) Solution: (
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 4 Solutions
1. For each part, give a simple description using set-builder notation of the language expressed.
(a) The language g
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 9 SOLUTIONS
1. The parts of this problem each require a relatively short answer. (Think before you write!)
(a) Give a proof that
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 1 Solutions
1. (a) Write a short informal English description of the set
cfw_ n | n = 7m for some m N and n = 2k for some k N .
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 3 (revised statement of Problem 5, now includes examples)
Due: Tuesday, September 27th at 11:00pm. No late work accepted.
Please
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 8
Due: Tuesday, November 15th at 11:00pm. No late work accepted.
Please complete your work for a single problem on its own page.
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 2
Due: Thursday, September 15th at 11:00pm. No late work accepted.
Be sure that each problem part/subpart is labeled with its nu
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 6
Due: Tuesday, October 25th at 11:00pm. No late work accepted.
Please complete your work for a single problem on its own page.
600.271: Automata and Computation Theory, Fall 2016
Homework Assignment 6 SOLUTIONS
1. Using input alphabet cfw_a, b, give the state diagram for a Turing machine that recognizes the
language
L1 = cfw_
601.231: Automata and Computation Theory, Fall 2017
Homework Assignment 1 SOLUTIONS
1. (a) Write a short informal English description of the set
cfw_ n | n = 7m for some m N and n = 2k for some k N .
1
600.231: Automata and Computation Theory, Fall 2017
Midterm 3 - Thursday, November 16th
Name (print):
JHED ID:
Academic Integrity Pledge.
I agree to complete this exam without unauthorized assistanc