COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
1
|
|
|
3
|
|
|
5
|
|
|
7
|
Detailed explanation-1: -Explanation: According to the question, minimum of 3 states are required to recognize an octal number divisible by 3.
Detailed explanation-2: -Can a DFA recognize a palindrome number? Explanation: Language to accept a palindrome number or string will be non-regular and thus, its DFA cannot be obtained.
Detailed explanation-3: -Explanation: As an FSM’s memory is limited by the number of states, it cannot perform the computational tasks that a Turing machine can do. A “Combinatorial FSM” is defined as a finite state machine with only one state and it allows actions based upon transition into a state. 2.
Detailed explanation-4: -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-5: -a)Input alphabetb)Transition functionc)Initial Stated)Output AlphabetCorrect answer is option ‘D’. Can you explain this answer?, a detailed solution for Which of the following is a not a part of 5-tuple finite automata? a)Input alphabetb)Transition functionc)Initial Stated)Output AlphabetCorrect answer is option ‘D’.