501 HW7 Maani
Question 1:
Theorem:
Let L be a regular set. Then there is a constant p such
that if z is any word in L, and |z| p, we may write z =
uvw in such a way that |uv| p, |v| 1, and for all i 0,
uviw is in L.
Proof by contradiction:
Assume that L i

501 HW3 Maani
a) ( + ) + ( + )
Constructed the union of the two languages as an NFA, then algorithmically
transformed it into a DFA, then algorithmically reduced it to its minimum size.
b) ( + )( ( + ) )
First constructed a language in which number of as

501 HW2 Maani
Question 1
The answer is no. -ly in slowly and lovely has different
functionalities which is why it should be considered as
two different morphemes.
Question 2
(a) True. The only string we could make with the
empty string would be the empty

501 HW4 Maani
This is the first idea:
Adding the two terms Taksim and Sariyer and ve well get:
To make possible terms like Taksim ve Taksim and Taksimler ve
Sariyerlerinkilerinki we have to make a mess like this:
Please consider that I have not supposed i