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 · 2026-03-31 14:19:04

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 31 Mar 2026 - 14:19

score 151 · Answer 2 · 2026-04-19 03:15:02

151

Views

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

Published on 19 Apr 2026 - 3:15

score 126 · Answer 3 · 2026-03-29 21:55:19

126

Views

Prove that a language is not regular

Published on 29 Mar 2026 - 21:55

score 435 · Answer 4 · 2026-03-27 10:16:06

435

Views

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

Published on 27 Mar 2026 - 10:16

score 952 · Answer 5 · 2026-05-04 21:12:19

952

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 04 May 2026 - 21:12

score 222 · Answer 6 · 2026-04-20 14:49:25

222

Views

General question about pumping lemma statement for regular languages

Published on 20 Apr 2026 - 14:49

score 492 · Answer 7 · 2026-05-02 15:14:20

492

Views

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

Published on 02 May 2026 - 15:14

score 1.1k · Answer 8 · 2026-05-01 11:50:54

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 01 May 2026 - 11:50

score 114 · Answer 9 · 2026-03-27 03:44:56

114

Views

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

Published on 27 Mar 2026 - 3:44

score 63 · Answer 10 · 2026-03-27 10:11:04

63

Views

Proving this language is non context-free

Published on 27 Mar 2026 - 10:11

score 116 · Answer 11 · 2026-04-30 13:20:49

116

Views

Regular Pumping Lemma

Published on 30 Apr 2026 - 13:20

score 1.3k · Answer 12 · 2026-03-25 12:21:13

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 25 Mar 2026 - 12:21

score 126 · Answer 13 · 2026-03-25 12:20:54

126

Views

Pumping lemma for two words that "completely different"

Published on 25 Mar 2026 - 12:20

score 579 · Answer 14 · 2026-03-25 12:20:37

579

Views

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

Published on 25 Mar 2026 - 12:20

score 211 · Answer 15 · 2026-03-25 12:21:14

211

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 25 Mar 2026 - 12:21

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