04-13-2012, 05:27 AM
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”.
For the NFA given below, you are required to determine an equivalent DFA for it using subset
construction. Where the alphabet is {a, b}.
Note: You must clearly mention the states of NFA which presents each and every state of DFA.
Only draw required final DFA.
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”.
For the NFA given below, you are required to determine an equivalent DFA for it using subset
construction. Where the alphabet is {a, b}.
Note: You must clearly mention the states of NFA which presents each and every state of DFA.
Only draw required final DFA.