Consider the following finite automata P and Q over the alphabet {a, b, c}.…
2007
Consider the following finite automata P and Q over the alphabet {a, b, c}. The start states are indicated by a double arrow and final states are indicated by a double circle. Let the languages recognized by them be denoted by L(P) and L(Q) respectively.
The automation which recognizes the language L(P) ∩ L(Q) is :
Answer: A. a — To find the automaton recognizing L(P) ∩ L(Q), construct a product automaton where each state is a pair (p, q) with p from P and q from Q. The start state is…
- A.
a
- B.
b
- C.
c
- D.
d
Attempted by 34 students.
Show answer & explanation
Correct answer: A
To find the automaton recognizing L(P) ∩ L(Q), construct a product automaton where each state is a pair (p, q) with p from P and q from Q. The start state is (p0, q0), and a state (p, q) is final if both p and q are final in their respective automata. Transitions are defined by applying the same input symbol to both components. The resulting automaton will accept strings that are accepted by both P and Q.
Explore the full course: Iocl Engineers Officers Grade A Paper 2