7.

Please select the correct choices (multiple choices can be correct)

r6 is defined below

Recall the definition of a finite automaton (DFA or NFA both) being able to process a string x from s to any destination state q: there is a sequence (90, 41,91, U2, ..., 9m-1, Um, 9m) such that go=5,9 m =9, the elements u142... Um string together to make x, and for allj, 1