CS-6205 - Automata Theory and Formal Language oed answer key
Showing 121 to 140 of 246 total answers.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
“Whenever H holds, C follows” can also be said as _______.
Answer
H → C
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A' will contain how many elements from the original set A?
Answer
0
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Given the productions S → αXβ, X → a, ___________________.
Answer
X is useful
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Which of the following ways can be done to simplify a CFG?
Answer
Eliminate productions of the form A → B
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
If R = {(1,1),(2,3),(4,5)}, then domain of the function is?
Answer
Dom R = {1,2,4}
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
One of the first programmable electronic computers in 1945.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
If R ={(1,1),(2,3),(4,5)}, then the Range of the function is?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The complement of an infinite language is necessarily finite.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The power set of a given set does not contain the set itself.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A good regular expression of a person's name is ______________.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
For a regular expression 'a', we can construct the following FA:
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The string aaaabbbccaaad is accepted by this regular expression.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Finite Automata all regular languages and only regular languages.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Which of the following will not be accepted by the following DFA?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
If A has m elements and B has n elements, then A x B has elements?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The entity which generate Language is termed as regular languages.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Which among the following cannot be accepted by a regular grammar?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Which of the following is a not a part of 5-tuple finite automata?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language