Saturday, 27 April 2013
Assignment
Question 1: [Marks: 10]
Σ = {a, b}
Write a Regular Expression, that only accepts strings with exactly two or three a’s in the string. There is no restriction on occurrence of b’s in the string.
Few examples of accepted strings are as under;
- bbaabbbba
- baba
- aba
- abaa
- aa
- aaa
etc.
Question 2: [Marks: 10]
Draw FA for the regular expression resulted in Question 1.
Question 1: [Marks: 10]
Σ = {a, b}
Write a Regular Expression, that only accepts strings with exactly two or three a’s in the string. There is no restriction on occurrence of b’s in the string.
Few examples of accepted strings are as under;
- bbaabbbba
- baba
- aba
- abaa
- aa
- aaa
etc.
Question 2: [Marks: 10]
Draw FA for the regular expression resulted in Question 1.
