String X is accepted by finite automata if .
A. δ*(q,x) E A
B. δ(q,x) E A
C. δ*(Q0,x) E A
D. δ(Q0,x) E A
Answer:A
String X is accepted by finite automata if .
A. δ*(q,x) E A B. δ(q,x) E A C. δ*(Q0,x) E A D. δ(Q0,x) E A
Explanation: If automata starts with starting state and after finite moves if reaches to final step then it called accepted.