Theory of Computation
CS-312
Homework 1
Fall 2016
Due Friday, 14 October 2016
Write the names of the participating members of your homework group here:
The exercises below are from the course textbook (Goddard). You may use jFLAP to
prepare answers as nee
Quiz 3
Theory of Computation
John Coggeshall
Part 1 - Show that 0n 1m m ? n is not regular
Let p be any number >=0
Let s = 0p 1(!p+p) (p 0's followed by p factorial + p 1's)
Let xyz be any strings ? ?s=xyz, |y| >=1 and |xy| <= p.
Note: y must contain only
Quiz 1 - CPSC-312
John Coggeshall
Problem 1 - even 1's or 0's but not both
states:
A: even, even
C: odd, even
B: even odd
D: odd, odd
1010101
1100
101010
001
A
M Values:
Q = cfw_A, B, C, D
E = cfw_1, 0
q =A
F = cfw_B, C
1
0
D:
A
B
C
D
0
1
B
0
cfw_B
cfw_A
Quiz 4
CPSC-312
John Coggeshall
Prof. Cater
Spring, 2001
Note: Nowhere in the quiz, or in the problems the quiz refers to says that the proof for
these questions must be formal. Therefore, I claim I shouldn't get marked down for
informality. ?
3.13 - Show
Take home Exam II
Professor Cater
John Coggeshall
1. A non-r.e. language
A The power set of any infinite language is a non-r.e. language - P(E*)
2. A r.e. language that is not recursive
Let a given language L be recursively enumerable. Although L is r.e.
John Coggeshall
CPSC-312
Quiz #2
a
a
Convert to GNFA:
Part 1
?
1
1
b
b
b
b
?
2
2
a
a
a
?
a*ba*
1
ba*
?
Part 2
a,b
aUb
a
a
1
1
2
2
b
b
?
b
a
b
a
3
3
?
?
1
aUba*b
?
?
a
1
3
aUb
2
?
?
a*b
a
3
?
aUba*ba
2. Show that the class of regular languages is closed un