- Engineering
- Computer Science
- 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)](https://homework-api-assets-production.s3.ap-southeast-2.amazonaws.com/uploads/store/983985332/16040305042a49765b78e1a6a690bb0341d5ae63d9.png)
Please answer the question as comprehensibly as you can with work if needed.
Solution by an expert tutor
