Theory of Computation - Old Questions
9. Describe the extended transition function of a NFA. Construct a NFA accepting the language over {a, b}* with each strings containing three consecutive b's. Show by extended function that it accepts abbb.
8 marks
|
Asked in 2074