Automata Theory Quiz | Automata Theory Multiple Choice Questions and Answers
Questions
1
For a given input, it provides the compliment of Boolean AND output.
Answer: NAND box (NOT AND)
2
It delays the transmission of signal along the wire by one step (clock pulse).
Answer: DELAY box
⭐ Make GKSeries Your Preferred Source on Google
Add GKSeries as Preferred Source
3
The terminals are designated by ________ letters, while the non-terminals are designated by ________ letters.
Answer: Small, capital
4
Grammatical rules which do not involve the meaning of words are called ---------------
Answer: Syntactic
5
The symbols that can’t be replaced by anything are called -----------------
Answer: Terminals
6
The symbols that must be replaced by other things are called __________
Answer: Non-terminals
8
The productions of the form nonterminal → one nonterminal, is called _________
Answer: Unit production
10
Which of the following statement is NOT true about TG?
Select correct option:
Answer: There exists exactly one path for certain string
11
Kleene’s theorem states
Select correct option:
Answer: Finite Automata are less powerful than Pushdown Automata.
12
In new format of an FA (discussed in lecture 37), This state is like dead-end non final state
Answer: REJECT
13
The major problem in the earliest computers was
Answer: To display mathematical formulae
14
Between the two consecutive joints on a path
Answer: Any no. of characters can be pushed and one character can be popped
15
Identify the TRUE statement:
Answer: Like TG, A PDA can also be non-deterministic
16
If an effectively solvable problem has answered in yes or no, then this solution is called ---------
Answer: Decision procedure
17
The following problem(s) ------------- is/are called decidable problem(s).
Answer: Both a and b
18
To examine whether a certain FA accepts any words, it is required to seek the paths from ------- state.
Answer: Initial to final
19
Grammatical rules which involve the meaning of words are called ---------------
Answer: Semantics
