Saturday, 27 April 2013
Question No 1: Marks
Given the regular expression
:
a) Construct an equivalent NFA using the Thompson’s Constructions algorithm. (10 marks)
b) Convert the NFA (constructed in part a) to a DFA. (10 marks)
Given the regular expression
:
a) Construct an equivalent NFA using the Thompson’s Constructions algorithm. (10 marks)
b) Convert the NFA (constructed in part a) to a DFA. (10 marks)
