The GATE Grind

GATE 2008 CS – Question 49

Theory of Computation · Regular Expressions and Finite Automata · 2 marks · MTA

Automata Y, Z have start1 and final2. Y transitions: 1:a→1, b→2; 2:a→2, b→1. Z:1:a→2, b→2;2:a→1, b→1. Which table is their product Z×Y? P starts, R is final; each row below gives (a-target, b-target) for P, Q, R, S.

  1. P:(S, R); Q:(R, S); R:(Q, P); S:(Q, P)
  2. P:(S, Q); Q:(R, S); R:(Q, P); S:(P, Q)
  3. P:(Q, S); Q:(R, S); R:(Q, P); S:(Q, P)
  4. P:(S, Q); Q:(S, R); R:(Q, P); S:(Q, P)

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: MTA

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Regular Expressions and Finite Automata questions

All Regular Expressions and Finite Automata questions →