FINITE AUTOMATA || MCQ QUESTION ||THEORY OF COMPUTATION (TOC) MCQ with Answers || PART -1

FINITE AUTOMATA || MCQ QUESTION ||THEORY OF COMPUTATION (TOC) MCQ with Answers #mcq#mcqquestiontheoryof compution#toc#TOCmcq#mssppu#technohindiworld FINITE AUTOMATA || MCQ QUESTION ||THEORY OF COMPUTATION (TOC) MCQ with Answers 1. There are ________ tuples in finite state machine. 2. Transition function maps. 3. Extended transition function is 4. Given Language: L= {ab U aba}* If X is the minimum number of states for a DFA and Y is the number of states to construct the NFA,|X-Y|=? 5. An automaton that presents output based on previous state or current input: 6. If NFA of 6 states excluding the initial state is converted into DFA, maximum possible number of states for the DFA is ? Explanation: The maximum number of sets for DFA converted from NFA would be not greater than 2n. 7. NFA, in its name has ’non-deterministic’ because of : 8. Number of states require to accept string ends with 10. 9. String X is accepted by finite automata if . 10. Languages of a automata is 11. Language of finite automata is. 12. Finite automata requires minimum _______ number of stacks. 13. Number of final state require to accept Φ in minimal finite automata. some keywords:- Theory of compution mcq mcq theory of compution Mcq TOC Finite automata mcq TOC mcq