1
The entity which generate Language is termed as:
Correct Answer
Grammar
☑ MCQ PRACTICE
Formal Languages and Automata Theory Unit 3
Practice objective questions for quick revision and examination preparation. Try answering each question before revealing the answer.
Formal Languages and Automata Theory - Unit-3
2
Which of the following statement is false?
Correct Answer
Context sensitive language is a subset of context free language
3
Which among the following cannot be accepted by a regular grammar?
Correct Answer
L is a set of 0n1n
4
Which of the expression is appropriate? For production p: a->b where a∈V and b∈_______
Correct Answer
(V+∑)*
5
What the does the given CFG defines? S->aSbS|bSaS|e and w denotes terminal
Correct Answer
Equal number of a’s and b’s
6
If L1 and L2 are context free languages, which of the following is context free?
Correct Answer
All of the mentioned
7
A grammar G=(V, T, P, S) is __________ if every production taken one of the two forms: B->aC, B->a
Correct Answer
Regular
8
A push down automaton employs ________ data structure.
Correct Answer
Stack
9
A string is accepted by a PDA when
Correct Answer
Both A & B
10
Which among the following is not a part of the Context free grammar tuple?
Correct Answer
End symbol
11
A context free grammar is a ___________
Correct Answer
A rule system for parsing formal languages
12
The closure property of context free grammar includes
Correct Answer
All of the mentioned
13
Which of the following automata takes stack as auxiliary storage?
Correct Answer
Push down automata
14
A null production can be referred to as:
Correct Answer
String
15
Halting states are of two types. They are:
Correct Answer
Accept and Reject
16
A pushdown automata can be defined as: (Q, ∑, G, q0, z0, A, d) What does the symbol z0 represents?
Correct Answer
all of the mentioned
17
A push down automata is said to be _________ if it has atmost one transition around all configurations.
Correct Answer
Deterministic
18
Which of the following languages is not context-free?
Correct Answer
{ a^n b^n c^n | n ≥ 0}
19
NPDA stands for
Correct Answer
Non-Deterministic Push Down Automata