Home » Theory of Computation » Theory of computation miscellaneous » Question

Theory of computation miscellaneous

Theory of Computation

Direction: Consider the following Finite State Automata:

  1. The minimum state automata equivalent to the above FSA has the following number of states
    1. 1
    2. 2
    3. 3
    4. 4
Correct Option: B

The behaviour as per the given PDA is an seen below
q0 to q1 → b*a
q1 to q2 → (a + b) *
Regular expression = b * a (a + b)*



Your comments will be displayed only after manual approval.