CS-6205 - Automata Theory and Formal Language oed answer key
Showing 201 to 220 of 246 total answers.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A __________ of a derivation is a tree in which each internal node is labeled with a nonterminal.
Answer
parse tree
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A good regular expression for any valid real number using engineering notation is ______________.
Answer
[0-9]+[0-9]*[(E|e)[0-9]+]
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
An example string w of a language L characterized by equal number of As and Bs is _______________.
Answer
ABBBAA
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A may or may not read an input symbol, but it has to read the top of the stack in every transition.
Answer
PDA
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Checking whether there is a matching parenthesis in a computer code can be done by a ______________.
Answer
context-free grammar
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Noam Chomsky gave a mathematical model in _______ which is effective for writing computer languages.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Every context free grammar can be transformed into an equvalent non deterministic push down automata.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
According to the 5-tuple representation i.e. FA= {Q, ∑, δ, q, F} Statement 1: q ϵ Q'; Statement 2: FϵQ
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A right-most derivation of a sentential form is one in which rules transforming the are always applied.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
For every pair of regular expressions R and S, the languages denoted by R(SR)* and (RS)*R are the same.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The number of elements in the set for the Language L={xϵ(∑r) *|length if x is at most 2} and ∑={0,1} is
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A DFA can remember a finite amount of information, but a can remember an infinite amount of information.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
If we can successfully and ly stimulate a TM with storage by two standard TMs, then ______________________
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The _____ of two sets A and B is the set containing those elements which are elements of A or elements of B.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The cardinality of the union of two disjoint sets is less than the sum of the cardinality of the given sets.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A string is accepted by a, iff the DFA/NDFA starting at the initial state ends in an after reading the string.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The commutativity property of set operations states that the union of any set with same set is the set itself.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Which of the following Set Operations produces the set that contains everything that is in Set A and in Set B?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language