Theory Of Automata And Formal Languages MCQs With Answers

The system wise way out is being mentioned here to make things certain about the Theory Of Automata And Formal Languages MCQs With Answers. You must approach the page on repeat basis so you can get the idea about the way out that is being informed through the way out for the allowed terms and conditions. You as student must get the idea how to stay in touch with the Theory Of Automata MCQs With Answers explained as per the approach through the formative way out.

Theory Of Automata And Formal Languages MCQs With Answers

Question1: FSM With Output Capability Can Be Used To Add Two Given Integer In Binary Representation. This Is
a. True
b. False
c. May be true
d. None of the mentioned

Question 2: Number Of States Require To Simulate A Computer With Memory Capable Of Storing ‘3’ Words Each Of Length ‘8’.
a. 3 * 2⁸
b. 2^(3*8)
c. 2⁽³⁺⁸⁾
d. None of the mentioned

Question 3: The Basic Limitation Of Finite Automata Is That?
a. It can’t remember arbitrary large amount of information.
b. It sometimes recognize grammar that are not regular.
c. It sometimes fails to recognize regular grammar.
d. All of the mentioned

Question 4: How Many DFA’s Exits With Two States Over Input Alphabet {0,1} ?
a. 16
b. 26
c. 32
d. 64

Question 5: Regular Expression For All Strings Starts With Ab And Ends With Bba Is.
a. aba*b*bba
b. ab(ab)*bba
c. ab(a+b)*bba
d. All of the mentioned

Question 6: Number Of Final State Require To Accept Φ In Minimal Finite Automata.
a. 1
b. 2
c. 3
d. None of the mentioned

Question 7: Finite Automata Requires Minimum _______ Number Of Stacks.
a. 1
b. 0
c. 2
d. None of the mentioned

Question 8: Language Of Finite Automata Is.
a. Type 0
b. Type 1
c. Type 2
d. Type 3

Question 9: Languages Of A Automata Is?
a. If it is accepted by automata
b. If it halts
c. If automata touch final state in its life time
d. All language are language of automata

Question 10: 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

Question 11: δ*(q,ya) Is Equivalent To?
a. δ((q,y),a)
b. δ(δ*(q,y),a)
c. δ(q,ya)
d. independent from δ notation

Question 12: Extended Transition Function Is?
a. Q * Σ* -> Q
b. Q * Σ -> Q
c. Q* * Σ* -> Σ
d. Q * Σ -> Σ

Question 13: Number Of States Require To Accept String Ends With 10.
a. 3
b. 2
c. 1
d. can’t be represented.

Question 14: Transition Function Maps?
a. Σ * Q -> Σ
b. Q * Q -> Σ
c. Σ * Σ -> Q
d. Q * Σ -> Q

Question 15: There Are ________ Tuples In Finite State Machine.
a. 4
b. 5
c. 6
d. Unlimited

These above questions are being explained according to the way out that is being made direct approach with the questions and their association through the final approach of Theory Of Automata And Formal Languages MCQs With Answers