CS-6205 - Automata Theory and Formal Language oed answer key
Showing 241 to 246 of 246 total answers.
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The basic model of a Turing machine consists of _______ and _______ , in which the finite control has finite set of states and the transition between the states.
Answer
finite control, input tape
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The tape head is positioned at one of the tape cells for scanning the input symbol from the input tape and initially the tape head points at the left most cell of the input tape.
Answer
TRUE
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
A Finite Automaton with null moves (FA-ε) does transit not only after giving input from the alphabet set but also without any input symbol. This transition without input is called a
Answer
Null Move
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
It refers to the measure of the number of times the tape moves when the machine is initialized for some input symbols and the space complexity is the number of cells of the tape written.
Answer
Time Complexity
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language
The theory of formal languages finds its applicability extensively in the fields of Computer Science. gave a mathematical model of grammar in which is effective for writing computer languages.
Answer
Noam Chomsky, 1956
#CS-6205
Awesome StudentQuestion • Automata Theory and Formal Language