1. Engineering
  2. Computer Science
  3. please answer the question as comprehensibly as you can with...

Question: please answer the question as comprehensibly as you can with...

Question details

1. Given the following FAs for the languages (a and b: -xt +x2 r1 .b :3 y3 a,b a,b construct the FA that is produced for the language (a) + b). Show the transition table and draw the transition diagram [Hint: This is NOT the simplest FA for the language fa, b)]. (8 points) 2. convert your FA from problem 1 (an FA is alsoa TG) into a regular expression (show the steps that you take). (4 points)

Please answer the question as comprehensibly as you can with work if needed.

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