483 views
0 votes
0 votes

Consider the following languages:

Which of the following statement is true?

  • Both L1 and L2 are regular
  • L1 is regular but L2 is non-regular
  • L2 is regular but L1 is non-regular
  • Neither of L1 or L2 is regular

Please log in or register to answer this question.

Related questions

0 votes
0 votes
2 answers
1
0 votes
0 votes
0 answers
2
TusharKumar asked Jan 21, 2023
311 views
Let L be a language over {a,b} that contains the same number of occurrences of a and b. which of the following is non-regular? a. b. c. d. MSQ & answer is a,c,d
1 votes
1 votes
1 answer
3
Gate Fever asked Jan 21, 2019
504 views
consider the language L= {$x^{l}y^{m}z^{n}$|(l+m+n) is divisible by 5}which of the following is correct?L is recursiveCSLCFLregular
0 votes
0 votes
1 answer
4
Devwritt asked Feb 3, 2017
299 views
It can accepts aa and/or bb .Please check?