CS606 Spring 2012 Second Assignment
Posted on Wednesday, 02 May 2012
in Spring 2012
Consider the following grammar;
S ―> XaYb
X ―> bXc | b
Y ―> dYa | d
Find the first sets for each non-terminal of the given grammar.
Read 62 times
CS606 Spring 2012 First Assignment
Posted on Wednesday, 11 April 2012
in Spring 2012
Question No 1: Marks 10
Construct Nondeterministic finite automata (NFA) for regular expression (a* | b*)* using
Thompson’s Construction Algorithm. Show the sequence of moves in processing the input string
“ababbab”.
Question No 2: Marks 10
For the NFA given below, you are required to determine an equivalent DFA for it using subset
construction. Where the alphabet is {a, b}.
Construct Nondeterministic finite automata (NFA) for regular expression (a* | b*)* using
Thompson’s Construction Algorithm. Show the sequence of moves in processing the input string
“ababbab”.
Question No 2: Marks 10
For the NFA given below, you are required to determine an equivalent DFA for it using subset
construction. Where the alphabet is {a, b}.
Read 129 times
CS606 Fall 2011 First Assignment
Posted on Tuesday, 08 November 2011
in Fall 2011
Question 1:
Suppose that you are working as a programmer in Microsoft. They assigned you a task to draw a finite acceptor which can be useful for lexical analyses of language L expressed as L = {w (a, b)* / nb(w) mod 3 > 1.}. You are requested to analyze this language and construct a deterministic finite acceptor of this language.
Read 179 times