Explore topic-wise MCQs in Automata Theory.

This section includes 4 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory knowledge and support exam preparation. Choose a topic below to get started.

1.

If a string S is accepted by a finite state automaton, S=s1s2s3 sn where si and there exists a sequence of states r0, r1, r2 rn such that (r(i), si+1) =ri+1 for each 0, 1, n-1, then r(n) is:

A. initial state
B. transition symbol
C. accepting state
D. intermediate state
Answer» D. intermediate state
Discussion
2.

If is the transition function for a given NFA, then we define the for the DFA accepting the same language would be:Note: S is a subset of Q and a is a symbol.

A. (S, a) =U<sub>p s</sub> (p, a)
B. (S, a) =U<sub>p s</sub> (p, a)
C. (S, a) =U<sub>p s</sub> (p)
D. (S) =U<sub>p s</sub> (p)
Answer» B. (S, a) =U<sub>p s</sub> (p, a)
Discussion
3.

What is wrong in the given definition?Def: ({q0, q1, q2}, {0,1}, , q3, {q3})

A. The definition does not satisfy 5 Tuple definition of NFA
B. There are no transition definition
C. Initial and Final states do not belong to the Graph
D. Initial and final states can t be same
Answer» D. Initial and final states can t be same
Discussion
4.

Choose the correct option for the given statement:Statement: The DFA shown represents all strings which has 1 at second last position.

A. n<img alt="The given figure is NFA with all strings which has 1 at second last position" class="alignnone size-full wp-image-351440" height="123" sizes="(max-width: 448px) 100vw, 448px" src="https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-extended-transition-function-q2.png" srcset="https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-extended-transition-function-q2.png 448w, https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-extended-transition-function-q2-300x82.png 300w" width="448"/>
B. Correct
C. Incorrect, Incomplete DFA
D. Wrong proposition
E. May be correct
Answer» D. Wrong proposition
Discussion