CS-6205 - Automata Theory and Formal Language oed answer key
Showing 221 to 240 of 246 total answers.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A pushdown automaton is a way to implement a context-free grammar in a similar way to design DFA for a regular grammar.
Answer
TRUE
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
An order rooted tree that graphically represents the semantic information a string derived from a context-free grammar.
Answer
Derivation tree
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
If a problem can be shown that it belongs to the class of recursively enumerable languages then ______________________.
Answer
It may be solved by any TM
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Is to be applied to show that certain languages are not regular. It should never be used to show a language is regular.
Answer
Pumping Lemma
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Turing hypothesis believed that a function is said to be computable if and only if it can be computed by a Turing machine.
Answer
FALSE
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Having the initial state as a final state, give the deterministic finite state automaton that accepts the regular expression.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A sub-tree of a derivation tree/parse tree such that either all of its children are in the sub-tree or none of them are in the
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The recursive inference procedure determines that string w is in the language of the variable A, A being the starting variable.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The __________ of a Turing machine depends on the current state of finite control and the tape symbol present in the input tape.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
It is a unary operator on a set of symbols or strings, that gives the infinite set of all possible strings of all possible lengths.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A set of strings of a's and b's of any length including the null string. So L= { ε, a, b, aa , ab , bb , ba, aaa.......}, the regular
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Elimination of productions and symbols is called simplification of CFGs. Simplification essentially comprises of the following steps:
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
T generate recursively enumerable languages. The productions have no restrictions and phase structure grammar including all formal grammars.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
IT generate recursively enumerable languages. The productions have no restrictions and phase structure grammar including all formal grammars.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
challenged the mathematical community to find an infallible, mechanical method for constructing and checking truth of mathematical statements.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
Context-free grammars are more expressive than finite automata; if a language L is by a finite automata then L can be by a context-free grammar.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A set of strings of a's and b's of any length including the null string. So L= { ε, a, b, aa , ab , bb , ba, aaa.......}, the regular expression is.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language