CS-6205 - Automata Theory and Formal Language oed answer key
Showing 61 to 80 of 246 total answers.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Empty set is a/an ________________.
Answer
Finite set
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
If Σ2 is {00, 01, 10, 11}, then Σ =
Answer
{0, 1}
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The CFG "S → (S) | SS | ε" accepts:
Answer
the string "((()))(())(())"
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The top symbol is read and removed.
Answer
Pop
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A language is regular if and only if.
Answer
Accepted by DFA
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The initial stack top symbol (I ∈ S).
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Who is the father of modern computer?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A DFA is defined ____________________.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A set of terminals where N ∩ T = NULL.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A pushdown automata can be regarded as:
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A set of final state/states of Q (F⊆Q).
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Given the language L = {ε}, is L empty?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Regular expression Φ* is equivalent to.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
What concept did Alan Turing introduce?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A DFA is represented by digraphs called.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A PDA is already in its accept state if:
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
What kind of languages does a TM decide?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
An alphabet is any finite set of symbols.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language