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

Theory of computation miscellaneous

Theory of Computation

  1. Given below are two finite state automata ( → indicates the start state and F indicates a final state)

    Which of the following represents the product automata Z × Y?



Correct Option: A

Given : Transition table for Y and Z
The number of states of Z = 2
The number of states of Y = 2
Z × Y

No. of states of the product of Z and Y = 2 × 2 = 4
Now, the states as per the given options are P, Q, R and S. The finite state automata is



Your comments will be displayed only after manual approval.