Recent questions tagged regular-languages - GATE CSE Doubts

0 votes

0 answers

Positive closures of any regular language will not contain epsilon?(True or False)

asked 4 days ago in Theory of Computation by Chirag Shilwant (102 points) | 4 views

+1 vote

1 answer

Which of the following are regular languages? [Source: Applied Course live session]

asked 5 days ago in Theory of Computation by Sathuri Bharath (126 points) | 18 views

0 votes

1 answer

why L2 is not regular? [Source: Applied Course live session]

asked 5 days ago in Theory of Computation by Sathuri Bharath (126 points) | 30 views

+1 vote

1 answer

checking if given languages are regular or not
Consider the following languages. Which one of the following statements is true ? (A) L1 is regular, L2 is non regular (B) L1 is non regular, L2 is regular (C) L1 is regular, L2 is regular (D) L1 is non regular, L2 is non regular My ... string and if it is, we can prove that L1 is regular, but how can L2 be regular as that order needs to be maintained!

asked 6 days ago in Theory of Computation by KINGSLAYER (106 points) | 38 views

0 votes

2 answers

Relation between A,B and C
Let A= (a + b)* ab (a + b)*, B= a*b* and C= (a + b)*. Then the relation between A, B and C: A. A+B= C B. $A^{R}+B^{R}=C$ C. $A^{R}$+B= C D. None of these

asked Aug 12 in Theory of Computation by Sambhrant Maurya (281 points) | 32 views

0 votes

1 answer

Stanford Lagunita
Which of the following grammars produce regular languages? A → (A)/ε A → (A(/ε A → (B)/(BB) B → (CC)/(CCC) C → (DDD) D → () A→ aA/b A→ Aa/b A→ aaAb/ε A→ AAaab/ε A→ AAaab/aab

asked Aug 9 in Theory of Computation by Sambhrant Maurya (281 points) | 7 views

To see more, click for the full list of questions or popular tags.

932 questions

596 answers

1,885 comments

81,474 users