CS402 Assignment No. 4
Monday, January 17, 2011 Posted In CS and IT Edit ThisQuestion No.1
*
1. Use Pumping Lemma Version I to find whether the language below is regular or non-regular , anbn+2 n = 1,2,3……..
*
2. Use Pumping Lemma Version II to find whether the language EVEN PALINDROME is regular or non-regular.
EVEN PALINDROM is defined as follows:
Language of all strings s belonging to ∑* where ∑ = {a,b}, such that
i) s = Reverse (s)
ii) length (s) = Even
Some strings belonging to this language are given below,
= ^ , aa , bb , aaaa , abba , baab , bbbb , ….. so on
..........
Theory of Automata
Assignment No.4
Due Date: 20th January, 2011
Objective of this assignment is to make students able to understand the following concepts,
- Pumping Lemma Version I & II
- Equivalence of two FA’s using Complementation Method
Question No.1
- Use Pumping Lemma Version I to find whether the language below is regular or non-regular ,
anbn+2 n = 1,2,3……..
- Use Pumping Lemma Version II to find whether the language EVEN PALINDROME is regular or non-regular.
EVEN PALINDROM is defined as follows:
Language of all strings s belonging to ∑* where ∑ = {a,b}, such that
i) s = Reverse (s)
ii) length (s) = Even
Some strings belonging to this language are given below,
= ^ , aa , bb , aaaa , abba , baab , bbbb , ….. so on
