loading...

CS402 Assignment 1 Solution Spring 2018

Question No 1: Marks:5
Construct a regular expression (RE) defining each of the following languages over the alphabet
∑={a b}:

All words ends in 3 consecutive b.
All words having at least one ‘a’

Question No 2: Marks=5+5=10
Construct an FA which recognizes the set of all strings defined over S = {x, y} starting with the prefix ‘xy’.cs402Assignmentsolution

DOWNLOAD SOLUTION HERE
loading...