1
What is the primary purpose of finite automata in computer science?
Correct Answer
To recognize patterns
☑ MCQ PRACTICE
Formal Languages and Automata Theory Unit 1
Practice objective questions for quick revision and examination preparation. Try answering each question before revealing the answer.
Formal Languages and Automata Theory - Unit-1
2
Which of the following is a central concept in Automata theory?
Correct Answer
Strings
3
In Automata Theory, a string is defined as:
Correct Answer
A sequence of symbols
4
What is an example of an application of Non-deterministic Finite Automata (NFA)?
Correct Answer
Text Search
5
A Non-deterministic Finite Automaton (NFA) differs from a DFA by:
Correct Answer
Having multiple transitions for the same input
6
Which of the following is the main feature of Epsilon-Transitions in NFAs?
Correct Answer
Transitions with no input
7
The formal definition of a DFA includes which of the following?
Correct Answer
A set of states, alphabet, transition function, start state, and accept state(s)
8
How does a DFA process strings?
Correct Answer
By following a unique path from start to an accepting state
9
Which of the following is true about a DFA's language?
Correct Answer
The language consists of strings that the DFA accepts
10
Conversion of an NFA with ε-transitions to an NFA without ε-transitions is called:
Correct Answer
ε-NFA removal
11
A Moore machine is a type of finite automaton where:
Correct Answer
Output depends on the current state only
12
What does a Mealy machine use to determine output?
Correct Answer
Current state and input symbol
13
The transition function in a DFA is:
Correct Answer
Deterministic for each state
14
What does the term "alphabet" in Automata theory refer to?
Correct Answer
A set of characters or symbols
15
Which of the following is true about an NFA?
Correct Answer
It can have multiple transitions for the same input
16
What is the main advantage of Nondeterministic Finite Automata over DFAs?
Correct Answer
NFAs require fewer states
17
Which of the following is a characteristic of deterministic finite automata (DFA)?
Correct Answer
A DFA has one path for each input symbol
18
In the process of converting an NFA to a DFA, what is created for each subset of NFA states?
Correct Answer
A unique DFA state
19
What type of machine can recognize regular languages?
Correct Answer
Finite Automata
20
Which of the following is a limitation of a DFA?
Correct Answer
It can only accept regular languages
21
What is the role of the start state in a DFA?
Correct Answer
It determines which state the automaton starts in
22
Which of the following is true about the transition diagram of a DFA?
Correct Answer
Each state has exactly one transition for each input symbol
23
How many different states can a DFA have?
Correct Answer
It can have a finite number of states
24
What does ε represent in an NFA with ε-transitions?
Correct Answer
A transition without consuming an input symbol
25
What is the first step in the conversion of an NFA to a DFA?
Correct Answer
Identify all possible subsets of NFA states
26
What is the result when a DFA processes a string that it does not accept?
Correct Answer
It reaches a dead state
27
Which of the following is true for a DFA with n states?
Correct Answer
It can process strings of any length
28
Which machine is primarily used for text search applications?
Correct Answer
Non-deterministic Finite Automata (NFA)
29
A transition function in a DFA is represented as:
Correct Answer
A set of rules defining state transitions
30
What is the role of an accepting state in a DFA?
Correct Answer
It accepts or rejects strings
31
Given the NFA transition table below, what is the transition for state q1 on input a?
Correct Answer
q2
32
Given the DFA transition table below, what is the final state for the input string "ab"?
Correct Answer
q2
33
Convert the following ε-NFA transition to an NFA without ε-transitions: δ(q0,ϵ)={q1}.
Correct Answer
δ(q0,a)={q0,q1}