Explore topic-wise MCQs in Automata Theory Questions and Answers.

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

1.

Number of times the state q3 or q2 is being a part of extended 6 transition state is

A. 6
B. 5
C. 4
D. 7
Answer» B. 5
Discussion
2.

From the given table, δ*(q0, 011) =?

A. {q0}
B. {q1} U {q0, q1, q2}
C. {q2, q1}
D. {q3, q1, q2, q0}
Answer» C. {q2, q1}
Discussion
3.

According to the given table, compute the number of transitions with 1 as its symbol but not 0:

A. 4
B. 3
C. 2
D. 1
Answer» E.
Discussion
4.

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
5.

If δ is the transition function for a given NFA, then we define the δ’ for the DFA accepting the same language would be:

A. Note: S is a subset of Q and a is a symbol.
B. δ’ (S, a) =Upϵs δ (p, a)
C. δ’ (S, a) =Up≠s δ (p, a)
D. δ’ (S, a) =Upϵs δ(p)
E. δ’ (S) =Up≠s δ(p)
Answer» B. δ’ (S, a) =Upϵs δ (p, a)
Discussion
6.

Choose the correct option for the given statement:

A. Statement: The DFA shown represents all strings which has 1 at second last position.
Answer» D.
Discussion