CS402 Fall 2011 First Assignment
Posted on Tuesday, 08 November 2011
in Fall 2011
Question No.1 Basic Concepts [Sets, Letters, Valid Alphabet, Languages, Strings and Words]
a. Which of the following are strings generated from alphabet Σ = {a, b}
Read 272 times
CS402 Fall 2011 2nd Assignment Solution
Posted on Friday, 11 November 2011
in Fall 2011
Question No.1
- 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.
- Draw the Transition graph (TG) for language of words starting with three a’s or three b’s and ending with bb or aa
- Draw the Transition graph (TG) for language of words having aab or bba anywhere in it
- Draw the Transition Graph (TG) for language of words EVEN-EVEN,
- Draw the Generalized Transition graph (GTG) for below given regular expression:
a*+ (ab+a)*(b+ Λ)+a*
Read 1194 times