Register

UGC NET CSE | July 2016 | Part 3 | Question: 24

• edited by
2,364 views
3 3 votes

Consider the following two languages:

$L_1=\{0^i1^j \mid ged (i,j)=1 \}$

$L_2$ is any subset of 0*

Which of the following is correct?

  1. $L_1$ is regular and $L_2*$ is not regular
  2. $L_1$ is not regular and $L_2*$ is regular
  3. Both $L_1$ and $L_2*$ are regular languages
  4. Both $L_1$ and $L_2*$ are not regular languages

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← Previous · UGC NET CSE | Decemb...Next → · if R1 and R2 are ref...
← Previous in category · UGC NET CSE | Decemb...Next in category → · UGC NET CSE | July 2...
Position:
Show:

Related questions

3 3 votes
8 8 answers
10.9k
10.9k views
go_editor asked Aug 20, 2016
10,890 views
UGC NET CSE | July 2016 | Part 3 | Question: 55
Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation $R_M$ defined by M as all states th...
4 4 votes
3 answers 3 answers
5.4k
5.4k views
Sanjay Sharma asked Jul 11, 2016
5,387 views
UGC NET CSE | July 2016 | Part 3 | Question: 23
The regular expression for the complement of the language $L=\{a^nb^m \mid n \geq 4, m \leq 3\}$ is:$(\lambda +a+aa+aaa)b^*+a^*bbbb^*+(a+b)^*ba(a+b)^*$$(\lambda +a+aa+aaa...
1 1 vote
2 answers 2 answers
3.1k
3.1k views
go_editor asked Aug 20, 2016
3,115 views
UGC NET CSE | July 2016 | Part 3 | Question: 22
The symmetric differences of two sets $S_1$ and $S_2$ is defined as:$S_1 \oplus S_2 =\{x \mid x \in S_1 \text{ or } x \in S_2, \text{ but x is not in both } S_1 \text{ an...
2 2 votes
5 answers 5 answers
2.2k
2.2k views
soujanyareddy13 asked May 10, 2021
2,160 views
UGC NET CSE | July 2016 | Part 3 | Question: 56
Let $L=\{0^n1^n|n\ge 0\}$ be a context free language. Which of the following is correct?$\overline L$ is context free and $L^k$ is not context free for any $k\ge1$$\overl...