Combinestudy

i. Draw the Transition graph (TG) for language of words in which the "b" occur only in even clumps and that end in four or more a's
ii. Draw the Transition graph (TG) for language of words starting with three a's or three b's and ending with bb or aa

cs402 Fall2011 2nd Quiz

Question No.1
Finite Automata
Consider the Language L of Strings, defined over Σ = {a, b}, staring and ending with
same letter. The RE of language is: (a+b) +a (a + b)*a + b (a + b)*b. Draw the FA of
given Language.
Question No.2
Transition Graph
Draw the TG for the language L of strings, defined over Σ = {a, b} in which if a occur it is
in the form of aaa and that ends in two or more b’s.
Some example strings are:
bb , bbb , bbbbb , ....

Question 3 part e is missing, please try it yoursefl, my mind stop working here.

VU Course Contents CS402-Theory Of Automata