Give a nondeterministic finite automaton that accepts the language generated by the regular expression

ASSIGNMENT

1. Convert the following regular grammar into a Finite Automata

S X

X x X | x Y

Y y Y | y Z

Z zZ | z

2. Convert the previous problem to a regular expression.
3. Write a grammar that generates an even number of X’s.
4. Convert problem 3 to a finite automata
5. Convert problem 3 to a regular expression
6. Give a nondeterministic finite automaton that accepts the language generated by the regular expression (a | ba | baaa)*

7. Convert the previous into a DFA
8. Convert the NFA below into a DFA. Where λ-transitions are the same as εtransitions.