CS402 Assignment 2 Solution Fall 2017

Question No 1:                                                                                                                 Marks:5+5=10

Construct a regular expression defining each of the following languages over the alphabet ∑={a      b}:

a)      All words without the pattern ‘bb’ in them.

b)      All words that ends with a or bbbb

 

Question No 2:                                                                                                                           Marks=5

Build an FA that accepts the language of all words over the alphabet ∑= {a    b} that have exactly two a’s. 

Download Solution Here Cs402assignmentSolution

DOWNLOAD SOLUTION HERE
loading...