Problem 2 Recall the following definitions of deterministic and nondeterministic finite automata: Definition i (Deterministic Finite Automaton). A deterministic nite automaton is a 5-tuple, M (Q,E, F, q , ), where: Q is a finite set of states is the input alphabet FG Q is a set of final states q, E Q is the initial state 8: Q Q is the transition function Definition 2 (Nondeterministic Finite Automaton). A nondeterministic nite automaton is a 5-tuple, M- where: Q, , F,-,8), Q is a finite set of states is the input alphabet FG Q is a set of final states q, Q is the initial state . : Q (Eu {A)) 2Q is the transitionfunction Problem 2 Recall the following definitions of deterministic and nondeterministic finite automata: Definition i (Deterministic Finite Automaton). A deterministic nite automaton is a 5-tuple, M (Q,E, F, q , ), where: Q is a finite set of states is the input alphabet FG Q is a set of final states q, E Q is the initial state 8: Q Q is the transition function Definition 2 (Nondeterministic Finite Automaton). A nondeterministic nite automaton is a 5-tuple, M- where: Q, , F,-,8), Q is a finite set of states is the input alphabet FG Q is a set of final states q, Q is the initial state . : Q (Eu {A)) 2Q is the transitionfunction