[Solved]Question 1 Construct Nfa Non Deterministic Finite Automata Following Language L Z B 3y Z X Q37020920

*) Question 1: Construct an NFA (non-deterministic finite automata) for the following language. L (z є {a, b)’ I 3y, z such that x-yz, y has an odd number of ‘b’ symbols, and z begins with the string ‘aa’) (Examples of strings in the language: x-babbaa, and x-abaabbaa. However, x = bbaababaa is not in the language.,) (*) Question 2: Convert the NFA from the previous problem into a DFA, as we did in class. Show transcribed image text *) Question 1: Construct an NFA (non-deterministic finite automata) for the following language. L (z є {a, b)’ I 3y, z such that x-yz, y has an odd number of ‘b’ symbols, and z begins with the string ‘aa’) (Examples of strings in the language: x-babbaa, and x-abaabbaa. However, x = bbaababaa is not in the language.,) (*) Question 2: Convert the NFA from the previous problem into a DFA, as we did in class.

Expert Answer

---

Answer to *) Question 1: Construct an NFA (non-deterministic finite automata) for the following language. L (z є {a, b)’ I 3y, z … . . .