Recent questions tagged regular-languages - GATE CSE Doubts

0 votes

1 answer

Proof that language is non-regular
The language is: binary strings in which the number of 1s is a multiple of the number of 0s; Intuitively, we can say that the language is not-regular. But, this can be formally proved using Myhill-Nerode theorem, as it has infinite ... L is nonregular I don't follow the therefore part - how did they conclude that the strings are in different equivalent class

asked Dec 21, 2019 in Theory of Computation by goxul (364 points) | 24 views

0 votes

0 answers

Is this a Regular language or not?
Here ‘w^r’ is the reverse of string ‘w’.

asked Oct 18, 2019 in Theory of Computation by luc_Bloodstone (35 points) | 18 views

0 votes

0 answers

Peter Linz Edition 4 Exercise 2.1 Question 7-c,d,e,f (Page No. 47)

asked Sep 27, 2019 in Theory of Computation by Kushagra गुप्ता (175 points) | 25 views

0 votes

1 answer

Can we decompose this regular language as concatenation of 2 languages?

asked Sep 9, 2019 in Theory of Computation by Siddharth Thevaril (6 points) | 24 views

0 votes

2 answers

Identify the class of the language
L = {PQ | P,Q $\in (a,b)^{*}$ and $n_{a}(P) = n_{b}(Q)$} The language is – DCFL but not Regular CSL but not CFL CFL but not DCFL Regular

asked Sep 5, 2019 in Theory of Computation by MRINMOY_HALDER (37 points) | 33 views

0 votes

0 answers

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

asked Aug 19, 2019 in Theory of Computation by Chirag Shilwant (167 points) | 13 views

+1 vote

1 answer

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

asked Aug 18, 2019 in Theory of Computation by Sathuri Bharath (73 points) | 25 views

0 votes

1 answer

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

asked Aug 18, 2019 in Theory of Computation by Sathuri Bharath (73 points) | 36 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 Aug 17, 2019 in Theory of Computation by KINGSLAYER (9 points) | 42 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, 2019 in Theory of Computation by Sambhrant Maurya (341 points) | 38 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, 2019 in Theory of Computation by Sambhrant Maurya (341 points) | 14 views

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

3,085 questions

1,538 answers

9,232 comments

89,827 users