Theory of Computation (3160704) MCQs

MCQs of Regular Languages and Finite Automata

Showing 1 to 10 out of 65 Questions
1 2 3 4 5 6
1.
Language recognized by finite automata is:
(a) Type 0
(b) Type 1
(c) Type 2
(d) Type 3
Answer:

Option (d)

2.
Finite automata require minimum _______ number of stack.
(a) 0
(b) 1
(c) 2
(d) 3
Answer:

Option (a)

3.
Which of the following are an application of Finite Automaton?
(a) Compiler Design
(b) Grammar Parsers
(c) Text Search
(d) All of the mentioned
Answer:

Option (d)

4.
FA has _______
(a) Unlimited Memory
(b) No memory at all
(c) Limited memory
(d) None
Answer:

Option (c)

5.
Limitations of finite state machine (FA) can overcome by:
(a) Push down automata
(b) Turing machine
(c) Both A and B
(d) None of these
Answer:

Option (c)

6.
A finite automata accepts:
(a) Any Language
(b) Regular Language
(c) Context Free Language
(d) Context Sensitive Language
Answer:

Option (b)

7.
A language is regular if and only if it is accepted by finite automata:
(a) The given statement is true
(b) Given statement is false
(c) Statement is partially true
(d) None of the mentioned
Answer:

Option (a)

8.
Which of the following is a not a part of 5-tuple finite automata?
(a) Input alphabet
(b) Transition function
(c) Output Alphabet
(d) Initial State
Answer:

Option (c)

9.
Regular grammar is a subset of __________ grammar
(a) Type 0
(b) Type 1
(c) Type 2
(d) Type 0,1,2
Answer:

Option (d)

10.
Statement: Any regular language can be accepted by a finite automaton is:
(a) Arden’s Theorem
(b) Kleene’s Theorem
(c) Rice Theorem
(d) None of these
Answer:

Option (b)

Showing 1 to 10 out of 65 Questions
1 2 3 4 5 6