CSE 105: Introduction to the Theory of Comptuation
Fall 2010
Problem Set 4
Instructor: Daniele Micciancio Due on: Wed. Nov 3, 2010
Problem 1
Use JFLAP to design Push Down Automata for the following language: The set of all strings over the alphabet cfw_a,
CSE 105: Introduction to the Theory of Comptuation
Fall 2010
Problem Set 2
Instructor: Daniele Micciancio
Due on:
Wed. Oct 13, 2010
Guidelines:
Same as for homework 1. Solutions to the homework should be submitted electronically
using turnin, and you shou
1. (10 marks) Write down a regular expression that describes the language of binary strings that represent numbers that are powers of two.
10
Typical mistakes: Some people couldnt remember which end of a binary representation was the low end (and so wrote
Finite Automata and Theory of Computation
October 24, 2006
Handout 15: Homework 7
Professor: Moses Liskov Due: November 2, 2006, in class.
Problem 1
Show that L is a Turing-recognizable language if and only if there is a mapping reduction from L to ATM .
Finite Automata and Theory of Computation
October 18, 2007
Handout 13: Homework 6
Professor: Moses Liskov Due: October 25, 2007, in class.
Problem 1
Prove that the class of Turing-recognizable languages is closed under concatenation and star.
Problem 2
Pr
CSE 105: Introduction to the Theory of Comptuation
Fall 2010
Problem Set 5
Instructor: Daniele Micciancio Due on: Wed. Nov 10, 2010
Problem 1
Let BIGGER be the set of all strings over the alphabet cfw_0, 1, > of the form x > y , where x and y are binary n
Finite Automata and Theory of Computation
October 4, 2007
Handout 11: Homework 5
Professor: Moses Liskov Due: October 18, 2007, in class.
Problem 1
For each language, determine if that language is context-free or not, and prove your answer. (a) L1 = cfw_w
CSE 105: Introduction to the Theory of Comptuation
Fall 2010
Problem Set 3
Instructor: Daniele Micciancio Due on: Wed. Oct. 20, 2010
Problem 1
Let L be the set of all strings (over the alphabet cfw_0, 1, +, =) of the form x + y = z , where x, y and z are
Finite Automata and Theory of Computation
September 13, 2007
Handout 7: Homework 3
Professor: Moses Liskov Due: September 20, 2007, in class. Note: Some of these problems will take some hard thinking! You should start on this problem set early.
Problem 1
CSE105 Homework Number 1 SOLUTIONS
October 6, 2010
Guidelines:
solutions to the homework should be submitted electronically, following the instructions on
the class website. As part of your solutions to this assignment you should submit: 1. A le with the