Programming
- Convert the following regular grammar into a Finite Automata
S X
X x X | x Y
Y y Y | y Z
Z zZ | z
- 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
- Convert problem 3 to a regular expression
- Give a nondeterministic finite automaton that accepts the language generated by the regular expression (a | ba | baaa)*
- Convert the previous into a DFA
- Convert the NFA below into a DFA. Where λ-transitions are the same as εtransitions.