WorksheetsFLAT Quiz
Total questions: 15
Worksheet time: 3mins
What does DFA stand for?
Deterministic Finite Automata
Digital Finite Algorithm
Dual Function Automata
Determined Final Automation
Which of the following accepts languages with ε-transitions?
DFA
NFA
ε-NFA
Moore Machine
Which machine provides output depending on the current state only?
DFA
NFA
Moore Machine
Mealy Machine
What is the alphabet in Automata Theory?
A type of grammar
A finite set of symbols
A set of strings
An infinite set
NFA is more powerful than DFA.
True
False
Which regular expression denotes the language of all strings with even number of a’s?
(aa)*
(a|b)*
ab*
(bb)*
Pumping Lemma is used to prove:
A language is regular
A language is not regular
An automaton is minimal
Grammar is ambiguous
What is the result of minimizing a DFA?
A faster DFA
A more accurate DFA
A DFA with the least number of states
A DFA with no transitions
Which of the following is a closure property of regular languages?
Union
Intersection
Complement
All of the above
Which law helps simplify regular expressions?
Boolean law
Algebraic law
De Morgan’s law
Set theory
Which of the following is a context-free language generator?
DFA
CFG
NFA
Regular Expression
Which tree visually represents derivations in CFG?
Binary Tree
Parse Tree
State Tree
Syntax Graph
Ambiguity in grammar means:
No output is produced
Multiple parse trees for the same string
Unrecognized language
Grammar is invalid
Which acceptance method is used in PDA?
Final state
Empty stack
Both a and b
None
Which of the following is NOT part of PDA definition?
Stack
Tape
Input alphabet
Set of states
