CS-6205 - Automata Theory and Formal Language oed answer key
Showing 141 to 160 of 246 total answers.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Number of final state require to accept in minimal finite automata.
Answer
None of the mentioned
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The intersection of sets A and B is expressed as _________________.
Answer
A ∩ B
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Which of the following statements is true about NPDA, DPDA, and RL?
Answer
RL ⊂ DPDA ⊂ NPDA
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
If L1 and L2 are regular sets then intersection of these two will be.
Answer
Regular
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Production Rule: aAb->agb belongs to which of the following category?
Answer
Context Sensitive Language
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Regular sets are closed under union,concatenation and kleene closure.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A PDA machine configuration (p, w, y) can be correctly represented as.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A set has n elements, then the number of elements in its power set is?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
How many rational and irrational numbers are possible between 0 and 1?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A good regular expression for any valid whole number is ______________.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
It process information in their efforts to eat, survive, and reproduce.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The first counting machine developed 5000 years ago in the Middle East.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
For bottom-up parsing, a PDA has the following four types of transitions:
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Which of the following statement is false in context of tree terminology?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
______ is used to derive a string using the production rules of a grammar.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
An English like abbreviations representing elementary computer operations.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Any production rule in the form A → B where A, B ∈ Non-terminal is called.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Which among the following is not a part of the Context free grammar tuple?
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language