CS-6205 - Automata Theory and Formal Language oed answer key
Showing 101 to 120 of 246 total answers.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
“If H then ” is also the same as saying _______.
Answer
“C if H”
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A transition function: Q × (Σ∪{ε}) × S × Q × S*.
Answer
δ
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
JASON can generally be parsed by ______________.
Answer
A CFG
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The entity which generate Language is termed as:
Answer
Grammar
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
__ is a finite set of symbols called the alphabet.
Answer
Σ
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A symbol X is reachable _________________________.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
According to what concept is CFL a superset of RL?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Leibniz introduced binary notation of calculation.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The string "0000111" is accepted by _____________.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Context Free Languages is closed under intersection.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Identify the modeling recognition of the word "then"
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
An indirect way of building a CFG is to _____________
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
If L is recursively enumerable then ________________.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The symbol used for the empty string is ____________.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
If A = {0,2) and B = {1,3), then Cartesian product is?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
If A = {5,6,7} and B = {7,8,9} then A U B is equal to:
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The string abe is accepted by this regular expression.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
How many sets belong to the power set of A = {a,b,c,d}?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language