Misal terdapat bahasa S* dengan S = { a, b} terdapat berapa banyak kata dalam bahasa di
atas yang memiliki : a. Length(2), b. Length(3), c. Length(n)
ANSWER
a. Length(2) [2]x[2] = 22
b. Length(3) [2]x[2]x[2] = 23
c. Length(n) [2]x[2]xx[2] = 2
n
Week 1, Problem 2
ANSWER
a. No.
abbba abbba (no element bb)
abbba abbba (no element bb or b only)
b. Cant
Because the element ab and ba must contain a and b element independently, but in S*
language independent b doesnt exist.
Week 1, Problem 3
ANSWER
a. No.
abbabaabab abbabaabab (no element b)
ANSWER
a. Prooved
S* = {ab, bb}
T* = {ab, bb, bbbb} element bbbb can be removed because it built from bb bb
S* = T*
b. Prooved
S* = {ab, bb}
T* = {ab, bb, bbb} element bbb cant be removed because no other element can built this
element.
Week 1, Problem 5
a. Buktikan jika x ada dalam palindrome, maka xn juga terdapat dalam palindrome tersebut.
b. Buktikan bahwa pada sebarang himpunan palindrome, jumlah string dengan length(3)
akan sama dengan jumlah string dengan length(4)
ANSWER
ANSWER
Example S = {a,b}
S+ = {a,b, aa, ab, bb, ba, }
S* = { , a , b, aa, ab, bb,ba }
(S+)* = { , a,b, aa, ab, bb, ba, }
(S*)+ = { , a,b, aa, ab, bb, ba, }
So (S+)* = (S*)+
Week 1, Problem 7
a. O* = OddNumber
Base : 1
Recursive : If x O* , then x+2 O*
b. S*
Base : aa, b
Recursive : If x S* and y S* , then xy S*
c. P* = Power of two
Base : 1
Recursive : If x P* , then 2x P*