CS-6205 - Automata Theory and Formal Language oed answer key
Showing 161 to 180 of 246 total answers.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.
Answer
TRUE
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A compact textual representation of a set of strings representing a language.
Answer
Regular Expressions
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A general purpose, programmable, information processor with input and output.
Answer
computer
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
It generate context-free languages. The productions must be in the form A → γ
Answer
Type-2 grammars
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Language may be derived from other strings using the productions in a grammar.
Answer
FALSE
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The first mechanical calculator using gears for calculation developed in 1642.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Z2 uses electricity to convey letters and transmit information quickly in 1844.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A regular expression consisting of a finite set of grammar rules is a quadruple.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A set of rules, P: N → (N U T)*, it does have any right context or left context.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Recursive : TM that always halt = ________________ : TM that may or may not halt
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The algebraic law of regular expression described by E + E = E is _____________.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The difference between regular expressions and finite automata is _____________.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Which among the following is the option for the given grammar? G->X111|G1,X->X0|00
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
* Starts with the starting symbol S. It goes down to tree leaves using productions.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A conceptual design for a machine consisting of a Mill, Store, Printer, and Readers.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The algebraic law of regular expression described by φE = φ = Eφ is _______________.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The transition a Push down automaton makes it additionally dependent upon the _____.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Any set that represents the value of the Regular Expression is called a Property set.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language