1. Engineering
  2. Computer Science
  3. give as much detail as possible to how you achieved...

Question: give as much detail as possible to how you achieved...

Question details

a)Construct a 6-state NFA and a regular expression for the language L E fa, b* x ends in ba or has exactly two as }, such that your NFA has at least one e-arrow and also multiple transitions on the same symbol. b) Construct an NFA from a regular expression ((aU(ab)*)c)* over the alphabet a, b, c), using the general construction described in the proof that NFAs can simulate regular expressions.Give as much detail as possible to how you achieved your answer

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution