Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
1. (5 points)
a) Suppose is the relation f(1 3) (2 3)g and is the relation f(3 4) (3 5)g.
R ; ; ; S ; ; ;
b) Suppose that and are arbitrary relations having exa
tly four
R S
ordered pairs. (In part (a), both relations have two ordered pairs.) What is
the largest possible number of ordered pairs in the relation Æ ? R S
1
) ((0 [ 1)(0 [ 1))
d) 0 10 10
e) ((0 [ 1)(0 [ 1)) (0 [ 1)
Whi
h of these represent the following sets of strings?
A) The set of binary strings
ontaining exa
tly two ones.
B) The set of binary strings of even length.
C) The set of binary strings of odd length.
D) The set of binary strings
ontaining an even number of ones.
E) The set of binary strings
ontaining an odd number of ones.
4. (10 points) Consider the following sets of strings:
a) f 2 f0 1g : has an even number of zeroesg
x ; x
A)
B)
2
C)
D)
a)
b)
d)
have been swit
hed; that is, a state is an a
epting state of 0 exa
tly
q M
and 0 . Then ( 0 ) = ( ).
M L M L M
3
state of . The same
omputation will lead to the state of 0 , but is
r M r M r
x .
Therefore, 0 a
epts exa
tly when does not a
ept , so ( 0 ) =
M x M x L M
L M( ).
Is this proof
orre
t? If so, say why. If not, say why not.
( 2 ), that is, a
epts a word exa
tly when 1 a
epts the word and
L M M M