Knowing that:

• DFA is the set of all deterministic finite automata
• NFA is the set of all nondeterministic finite automata
• NFAis the set of all nondeterministic finite automata
• RE is the set of all regular expressions
• L(x) is the language of x

Choose all correct answers from the choices below:

A)	xDFA. yNFA. L(x)=L(y)
B)	xNFA. yDFA. L(x)=L(y)(zNFA. z=y)
C)	None of them apply (None of the given options apply)
D)	yNFA. xDFA. L(x)=L(y)
E)	xNFA. yNFA. xyL(x)=L(y)
F)	x. xNFA(yRE. L(x)=L(y))