برای اینکه نمی تونم خوب به فارسی بنویسم سوال ها رو به انگلیسی می نویسم.
1. Prove that L= { w | w != Reverse(w) } is not a regular language.
2. Prove that the set of all regular expresions over the alphabet {a,b} is a context free language.
3. Let A and B be languages and L = { X | XY is in A and Y is in B } prove that if A and B are regular languages then so is L.
4. Let L = { a^nb^n | n >= 0 }U{a^nb^2n | n >= 0 }, prove that L is context free but it is not a deterministic context free language.
5. Prove that if A is an infinite countable set, then there exists an infinite countable subset of A named B, such that A-B is also an infinite countable set.
2. Prove that the set of all regular expresions over the alphabet {a,b} is a context free language.
3. Let A and B be languages and L = { X | XY is in A and Y is in B } prove that if A and B are regular languages then so is L.
4. Let L = { a^nb^n | n >= 0 }U{a^nb^2n | n >= 0 }, prove that L is context free but it is not a deterministic context free language.
5. Prove that if A is an infinite countable set, then there exists an infinite countable subset of A named B, such that A-B is also an infinite countable set.
1 comment:
fekr konam emtehaane maa aasoon tar bood ;) :p
Post a Comment