Problem 1 1. What is the difference between deterministic and non-det 2. Evaluate the following using the NFSA. a) t(S, aaa) b) t(S, aaba) 3. Explain why Turing machine is a powerful in computing? 4. Mention and explain at least the three CFLs and give a go Problem 2 1. For Each Of The Following NFAs, Find The Equivalent Get The Resulting Regular Expressions. A b a B b a 1 Page (a) 91 a, b d
