Theory of Computation - Regular Language Models
| Present state | Next state, z | |
| X = 1 | X =0 | |
| A | D, 0 | B, 0 |
| B | B, 1 | C, 1 |
| C | B, 0 | D, 1 |
| D | B, 1 | C, 0 |
7. An FSM can be used to add how many given integers?
- Option : D
- Explanation : Finite Automata (FA) or Finite State Machine to add two integers can be constructed using two states: q0: Start state to represent carry bit is 0 q1: State to represent carry bit is 1
