MCQ IN COMPUTER SCIENCE & ENGINEERING

Previous
Next

COMPUTER SCIENCE AND ENGINEERING

THEORY OF COMPUTATION

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
There are ____ tuples in finite state machine.
A
4
B
5
C
6
D
7
Explanation: 

Detailed explanation-1: -Finite State Machine is defined formally as a 5‐tuple, (Q, , T, q0, F) consisting of a finite set of states Q, a finite set of input symbols , a transition function T: Q x →Q, an initial state q0 ∈ Q, and final states F ⊆ Q . FSM can be described as a state transition diagram.

Detailed explanation-2: -Finite Automata consists of 5 tuples Q, , q0, F, . Q → set of all states. → Transition Function. It accepts language which starts with ba.

Detailed explanation-3: -NFA consists of 5 tuples Q, , q, F, .

Detailed explanation-4: -A finite automaton is a collection of 5-tuple (Q, ∑, , q0, F), where: Q: finite set of states. ∑: finite set of the input symbol.

Detailed explanation-5: -Solutions 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’.

There is 1 question to complete.
Previous
Next