COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Statement 1 is false but Statement 2 and 3 are correct
|
|
|
Statement 1 and 2 are correct while 3 is wrong
|
|
|
None of the mentioned statements are correct
|
|
|
All of the mentioned
|
Detailed explanation-1: -Explanation: It is possible to represent a finite automaton graphically, with nodes for states, and arcs for transitions. Explanation: According to the question, minimum of 3 states are required to recognize an octal number divisible by 3.
Detailed explanation-2: -Finite automata can be represented by input tape and finite control. Input tape: It is a linear tape having some number of cells. Each input symbol is placed in each cell. Finite control: The finite control decides the next state on receiving particular input from input tape.
Detailed explanation-3: -Explanation: Finite automata doesn’t require any stack operation. 10. Number of final state require to accept in minimal finite automata. Explanation: No final state requires.
Detailed explanation-4: -It is a mathematical model of a system with discrete inputs, outputs, states and a set of transitions from state to state that occurs on input symbols from the alphabet .