حل واجب

الواجب يخلص يوم ١٥ ميلادي

28 large KINGDOM OF SAUDI ARABIA | JAZAN UNIVERSITY COLLEGE OF ENGINEERING & COMPUTER SCIENCE LAB ASSIGNMENT - Academic Year Semester First Course with code Theory of Computation COMP) Section Type of Assignment Individual Marks 10 Date of Announcement Deadline ASSIGNMENT PROBLEM STATEMENT Answer All Questions. Each question carries TWO marks. 1. Design a non-deterministic finite automaton (NFA) with ε-transitions that accepts all binary strings which contain o either “” or “” as a substring, and o end with a ‘1’. (e.g., accepts , , ; rejects , ) 2. Construct a minimized DFA for the regular expression (0+1)*0(0+1)*1 i.e., strings that start with any sequence of 0s and 1s, have at least one ‘0’ before the last ‘1’, and may include “00” in between. 3. Convert the regular expression (ab+ba)* …