Question

1. Let S and T be language over ={a,b}
represented by the regular expressions
(a+b*)* and (a+b)*, respectively. Whic
the following is true? (GATE CS 2000)​

Answer 1

Answer:

hgsaetuilvxzaasslollfssxg

Answer 2

Answer:

S and T

Explanation:

Both have same output because if we draw DFA of is S which is ( a+b*)* , at final state it is just repeating.

please please please mark as Brainly