Prof. Dr.

Andreas Podelski
Dr. Jochen Hoenicke
Sergiy Bogomolov
J urgen Christ
Matthias Heizmann
Martin Wehrle
October 19, 2010
Submission: October 25, 2010
at the beginning of the lecture
1. Exercise Sheet for the Lecture
Theory II
Aufgabe 1: Relations 1+1+1 points
Are the following relations equivalence relations? Justify your answer.
a) R
a
= {(x, y) N N | x, y have the same checksum}
b) R
b
= {(x, y) N N | x = y}
c) R
c
= {(x, y) N N | x y mod 42},
where x y mod k is dened as Z : x = y + k
Aufgabe 2: Languages 1+1+1 points
Let be an alphabet, and let L, L

be formal languages consisting of nitely many

words (i. e., |L| N and |L

| N).
Prove or disprove the following statements:
a) L L

= L

L
b) |L
n
| = |L|
n
c) |
n
| = ||
n
Aufgabe 3: Kleene closure 0.5+1.5+2 points
Let L be a language such that L. Show that L

is the smallest language that contains

L and is closed under concatenation. Therefore, you have to show the following:
(a) L L

.
(b) L

(c) For a language L

such that L L

and L

, it also holds that L