Consider the following languages:
L1={a^{źZ}| ź is an integer}
L2={a^{zź} | ź>0}
L3={ωω| ω{a,b}*}
Which of the languages is (are) regular?

A

L1 and L2 only

B

L1 and L3 only

C

L1 only

D

L2 only

E

None of the above

Question 6 Explanation:

A language is Regular language only if it creates an AP series.
Here only statement 2 makes an AP series. Example: L be a lanusage where i=1 and Z>= 0 then L ={ epsilon, a, aa, aaa, aaaa,………………} which is an AP. And Finite automata for this will be

Correct Answer: E

Question 6 Explanation:

A language is Regular language only if it creates an AP series.
Here only statement 2 makes an AP series. Example: L be a lanusage where i=1 and Z>= 0 then L ={ epsilon, a, aa, aaa, aaaa,………………} which is an AP. And Finite automata for this will be