# MCQ IN COMPUTER SCIENCE & ENGINEERING

## COMPUTER SCIENCE AND ENGINEERING

### THEORY OF COMPUTATION

 Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
There are various symbols used in representing a Finite State Machine. They are named ____
 A State, Start state, Accept state and transition B State, Slow state, Fast state and Progression C Start, Go state, Stop state and Halt D Begin state, Engage state, Process and Halt
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: -The transition function can be represented as T(current state, current input symbol) next state. For instance if q0 is the current state and 0 is the current input symbol, then the transition function is T(q0, 0) q1.

Detailed explanation-3: -Definition: If a finite state machine finishes an input string and is in an accepting state, the string is accepted or considered to be valid. See also recognizer. Note: A machine may enter an accepting state, then leave it.

There is 1 question to complete.