CSCI150 - Assignment 3
1.7
b.
0,1
0,1
q0
0
q1
1
q2
0
q3
1
c.
0
q1
q2
0
q0
q3
1
q4
1
q5
f.
1
q0
1
0
q1
0
1
q2
This transition might
be redundant.
q4
1.12
b
a
q0
q1
a
q2
q3
b
a
b
b
a
q4
a,b
1.13
0,1
q1
0
0
0
q1
1
1
q1
q1
0
1
q1
1
1.15
N1
N
t
t
If the start
CS150 - Fall 2009
Homework 10 - Solutions
1. (a) Let P (S ) be the power set of S , where |S | = . Since S is countable, there must exist a
bijection from S to N. To prove that P (S ) is not countable, it is sucient to show P (N) is
not countable.
Assume
CS150 - Fall 2009
Homework 9 - Solutions
For all of the solutions, well assume that the tape is innitely long on both ends. Even if it isnt its
trivial to make more spaces on the limiting hand by moving all the symbols over to the other side.
1. (a) L is
Homework 4
Solution
1. Regular languages are closed under union, intersection and difference. And since symmetric
difference of S1 and S2 is equivalent to (S1 S2) (S1 S2), regular language is closed under
symmetric difference.
2.
All of the following can