Question:medium

Suppose a language \(L_1\) has 2 states and \(L_2\) has 2 states. After using the cross product construction method, we have a machine \(M\). The total number of states in \(M\) are

Show Hint

Cross Product Construction: If DFA\(_1\) has \(m\) states and DFA\(_2\) has \(n\) states, then product DFA has \[ m\times n \] states.
Updated On: Jun 25, 2026
  • 6
  • 4
  • 2
  • 8
Show Solution

The Correct Option is B

Solution and Explanation

Was this answer helpful?
0

Top Questions on Theory of Computations

Questions Asked in TS PGECET exam