Convert the previous problem to a regular expression. Write a grammar that generates an even number of X’s. Convert problem 3 to a finite automata.

Programming

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

1. Convert the previous problem to a regular expression.
2. Write a grammar that generates an even number of X’s.
3. Convert problem 3 to a finite automata.
4. Convert problem 3 to a regular expression
5. Give a nondeterministic finite automaton that accepts the language generated by the regular expression (a | ba | baaa)*
6. Convert the previous into a DFA
7. Convert the NFA below into a DFA. Where λ-transitions are the same as εtransitions.