Question

Prove that $\{w \mid \text{ w has even length and the first half of w has more 0s than the second half of w} \}$ is not regular?

score 1.4k · Answer 1 · 2015-11-15 19:46:55

1.4k

Views

Prove that $\{w \mid \text{ w has even length and the first half of w has more 0s than the second half of w} \}$ is not regular?

Published on 15 Nov 2015 - 19:46

score 150 · Answer 2 · 2015-11-21 00:14:50

150

Views

Prove that the class of Turing Decidable Languages is strictly larger than class of Context Free Languages

Published on 21 Nov 2015 - 0:14

score 125 · Answer 3 · 2015-11-30 15:53:15

125

Views

Prove that a language is not regular

Published on 30 Nov 2015 - 15:53

score 434 · Answer 4 · 2015-12-01 01:10:57

434

Views

Pumping lemma for context free. How do I define the string 'w' and define cases?

Published on 01 Dec 2015 - 1:10

score 950 · Answer 5 · 2015-12-01 18:29:33

950

Views

Using the Pumping Lemma to show that the language of all strings of even length having no $0s$ in their second half is not regular

Published on 01 Dec 2015 - 18:29

score 220 · Answer 6 · 2015-12-01 18:37:01

220

Views

General question about pumping lemma statement for regular languages

Published on 01 Dec 2015 - 18:37

score 489 · Answer 7 · 2015-12-04 08:05:43

489

Views

Proving that the language $\{w\in \{a,b\}^* \big|\#_a(w)< \#_b (w)\}$ is non regular using the pumping lemma

Published on 04 Dec 2015 - 8:05

score 1.1k · Answer 8 · 2026-03-19 23:15:27

1.1k

Views

Proving that $\mathscr L=\{0^n \big|\text{n is the square of a natural number }\}$ is non regular using the pumping lemma

Published on 19 Mar 2026 - 23:15

score 113 · Answer 9 · 2026-03-22 07:06:59

113

Views

Proving that the language $\mathscr L$ is non regular using the pumping lemma

Published on 22 Mar 2026 - 7:06

score 62 · Answer 10 · 2015-12-06 13:47:32

62

Views

Proving this language is non context-free

Published on 06 Dec 2015 - 13:47

score 114 · Answer 11 · 2015-12-10 02:29:53

114

Views

Regular Pumping Lemma

Published on 10 Dec 2015 - 2:29

score 1.3k · Answer 12 · 2015-12-12 10:51:59

1.3k

Views

Is $L_1 = \{w ∈ {0,1}∗ | \text{w has at least as many occurrences of (110)’s as (011)’s}\}$ regular?

Published on 12 Dec 2015 - 10:51

score 125 · Answer 13 · 2016-01-10 10:10:08

125

Views

Pumping lemma for two words that "completely different"

Published on 10 Jan 2016 - 10:10

score 578 · Answer 14 · 2016-01-15 10:11:16

578

Views

Is $L=\{o^{i}1^{i}o^{j}1^{i} | i,j>0\}$ a context free language?

Published on 15 Jan 2016 - 10:11

score 210 · Answer 15 · 2016-01-15 10:32:42

210

Views

Is $L=\{o^{i}1^{j}o^{j}1^{k}o^{k}1^{i} | i,j,k>0\}$ a context free language?

Published on 15 Jan 2016 - 10:32

List Question

Prove that $\{w \mid \text{ w has even length and the first half of w has more 0s than the second half of w} \}$ is not regular?

Prove that the class of Turing Decidable Languages is strictly larger than class of Context Free Languages

Prove that a language is not regular

Pumping lemma for context free. How do I define the string 'w' and define cases?

Using the Pumping Lemma to show that the language of all strings of even length having no $0s$ in their second half is not regular

General question about pumping lemma statement for regular languages

Proving that the language $\{w\in \{a,b\}^* \big|\#_a(w)< \#_b (w)\}$ is non regular using the pumping lemma

Proving that $\mathscr L=\{0^n \big|\text{n is the square of a natural number }\}$ is non regular using the pumping lemma

Proving that the language $\mathscr L$ is non regular using the pumping lemma

Proving this language is non context-free

Regular Pumping Lemma

Is $L_1 = \{w ∈ {0,1}∗ | \text{w has at least as many occurrences of (110)’s as (011)’s}\}$ regular?

Pumping lemma for two words that "completely different"

Is $L=\{o^{i}1^{i}o^{j}1^{i} | i,j>0\}$ a context free language?

Is $L=\{o^{i}1^{j}o^{j}1^{k}o^{k}1^{i} | i,j,k>0\}$ a context free language?

Trending Questions

Popular # Hahtags

Popular Questions