CLASS -11 COMPUTER SCIENCE
CHAPTER- 11 STATES AND TRANSITIONS
🔔To download textbook pdf click on the ''DOWNLOAD'' button below -
NOTES FOR COMPLETE UNDERSTANDING -
- A computational system follows an IPO (input-Process-Output).
- In this cycle, state and transitions are there therefore we can say - “A typical computational system starts with an initial state, upon receiving certain input, it goes into computation and undergoes many states; this continues until termination at which point, an output can be retrieved from the final state.”
- Every computing machine uses states and transition for its working.
- State : A state is a state-of-computation with a specific set of information that is sufficient to determine the future possible behaviour.
- Transition : A transition is a marked change from one state to another in response to some external input and or stimulations.
- S1 => S2 meaning transition from S1 state to S2 state. Where S1 is a predecessor and S2 is a successor state .
- Some examples of STATE-TRANSITION diagrams :
🔔MORE MATERIALS TO BE UPLOADED STAY TUNED🔔
