CS 381 Assignment 1 due Friday, Sept. 1, 2006 1. a) Prove that {0,1} * is countably infinite. b) Prove that the set of all subsets of {0,1} * is not countably infinite. c) Can we assign a unique name to each subset of {0,1} * ? Explain your answer. 2
CS 381 Assignment 7 due Friday, Oct. 20, 2006
Please write your name and net id on all pages turned in. We need net id to record your grade. If you turn in each problem on a separate sheet we will grade your problems in parallel and get your assignm
Com S 381 Homework 7 Solutions 1. L : { wwR | w (a+b)* } is not a regular set. Suppose L is regular. Then there exists a constant n such that for every string w in L such that |w| n, we can break w into three strings w = xyz such that: y |xy| n Fo
CS 381 Assignment 8 due Friday, Nov. 3, 2006 Please write your name and net id on all pages turned in. We need net id to record your grade. If you turn in each problem on a separate sheet we will grade your problems in parallel and get your assignmen
CS 381 HW 8 Solutions
Dan FitzGerald, [email protected] November 1, 2006
1. Convert the following CFG to a one state PDA:
S bA S aB A a A bAA A aS B b B bS B aBB
The main idea of this problem is summarized on page 238 of the text. Basically,
CS 381 Assignment 9 due Friday, Nov. 10, 2006 Please write your name and net id on all pages turned in. We need net id to record your grade. If you turn in each problem on a separate sheet we will grade your problems in parallel and get your assignme
CS 381 HW 9 Fall 2006 Solution to Problem 1 1. We construct a turing machine that lists all possible strings in the alphabet in order and simulates the turing machine M on each of the possible strings; the machine lists each string accepted by M. Sin
CS 381 Assignment 10 due Friday, Nov. 17, 2006 Please write your name and net id on all pages turned in. We need net id to record your grade. If you turn in each problem on a separate sheet we will grade your problems in parallel and get your assignm
CS 381 Assignment 11 due Friday, Dec. 1, 2006 Please write your name and net id on all pages turned in. We need net id to record your grade. If you turn in each problem on a separate sheet we will grade your problems in parallel and get your assignme
CS 381 Assignment 6 due Friday, Oct. 6, 2006
Please write your name and net id on all pages turned in. We need net id to record your grade. If you turn in each problem on a separate sheet we will grade your problems in parallel and get your assignme
CS 381 Assignment 6 Solutions Please note that there are many possible solutions for each of the CFGs. 1. {xxRwwR | x{a,b}*,w{a,b}*} S -> EE E -> | aEa | bEb 2. {anbmcn+m | n,m 0} S -> aSc | T T -> bTc | 3. {aibj | i = j or i = 2j} S -> T | U T ->
CS 381 Homework 5 Solutions
Fall 2006
September 29, 2006 1:
The set consists of strings of blocks of 0s and 1s where each block is separated by a 2; each block can have any combination of 0s and 1s; the length of each successive block is one greater
Solutions for Homework 1 of COM S 381
Fall 2006 September 4, 2006
Problem 1
(a)
We want to give a one-one on-to mapping f from {0, 1} to the set of natural numbers. Dene f () = 1, f (0) = 2, f (1) = 3, f (00) = 4, f (01) = 5, f (10) = 6, f (11) = 7
CS 381 Assignment 2 due Friday, Sept. 8, 2006 Please write your name and net id on all pages turned in. We need net id to record your grade. If you turn in each problem on a separate sheet we will grade your problems in parallel and get your assignme
CS 381 Assignment 3 due Friday, Sept. 15, 2006 Please write your name and net id on all pages turned in. We need net id to record your grade. If you turn in each problem on a separate sheet we will grade your problems in parallel and get your assignm
CS 381 Assignment 4 due Friday, Sept. 22, 2006 Please write your name and net id on all pages turned in. We need net id to record your grade. If you turn in each problem on a separate sheet we will grade your problems in parallel and get your assignm
Ans 1) Its the set consisting of 0s and 1 where the number of ones is equal to the number of blocks of zeroes. Ones are never consecutive. All strings end with 1 and begin with 0. There can be odd as well as even blocks of zeroes. The relationship be
CS 381 Assignment 5 due Friday, Sept. 29, 2006
Please write your name and net id on all pages turned in. We need net id to record your grade. If you turn in each problem on a separate sheet we will grade your problems in parallel and get your assign
CS381 Fall 2005
Second Mid Term Olin 155
Friday Nov 4, 2005 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.