Question

Prove $\{0^k10^k10^k1 \in \{0,1\}^* \mid k \geq 0 \}$ is not context free

score 884 · Answer 1 · 2026-03-25 18:50:18

884

Views

Prove $\{0^k10^k10^k1 \in \{0,1\}^* \mid k \geq 0 \}$ is not context free

Published on 25 Mar 2026 - 18:50

score 1.8k · Answer 2 · 2021-02-27 05:03:13

1.8k

Views

Prove or disprove: If $A$ and $A ∩ B$ are regular, then $B$ is regular.

Published on 27 Feb 2021 - 5:03

score 454 · Answer 3 · 2021-02-27 06:08:23

454

Views

Prove or disprove: If $A$ is regular and $A ∩ B$ is not regular, then $B$ is not regular.

Published on 27 Feb 2021 - 6:08

score 933 · Answer 4 · 2021-02-28 03:33:39

933

Views

Prove or disprove: If $A$ is regular and $B$ is not regular, then $A ∩ B$ is not regular.

Published on 28 Feb 2021 - 3:33

score 174 · Answer 5 · 2026-03-28 08:51:11

174

Views

Prove that the language $A= \left \{ x\in\left \{ 0, 1 \right \}^{*}\mid\#\left ( 0, x \right )= \#\left ( 1, x \right ) \right \}$ is not regular.

Published on 28 Mar 2026 - 8:51

score 230 · Answer 6 · 2026-03-28 08:48:06

230

Views

Write an NFA with only four states

Published on 28 Mar 2026 - 8:48

score 156 · Answer 7 · 2021-03-07 11:56:52

Automata | Proving that if $L$ is regular then $L'$ (word in $L'$ is a word from $L$ without the first and the last letter) is regular too.

score 36 · Answer 8 · 2021-03-10 23:56:34

36

Views

Show that $A=\{0^m 1^n |\text{ }m\text{ is even or }m > n\}$ has infinitely many equivalence classes to prove non-regularity.

Published on 10 Mar 2021 - 23:56

score 33 · Answer 9 · 2021-03-11 00:38:21

33

Views

Show that $A=\{0^k 1^m 0^n |\text{ }n=k+m\}$ has infinitely many equivalence classes.

Published on 11 Mar 2021 - 0:38

score 194 · Answer 10 · 2026-03-25 18:45:17

194

Views

questions about the pumping lemma

Published on 25 Mar 2026 - 18:45

score 123 · Answer 11 · 2021-03-15 19:12:22

123

Views

$L^2$ = $L$ equality implications for a formal language

Published on 15 Mar 2021 - 19:12

score 82 · Answer 12 · 2021-03-17 12:49:47

82

Views

What's the purpose of the word $w$ in the proof for $ L \in \mathsf{REG} \implies L(\varphi) \in \mathsf{MSO}$ with $L(\varphi) = L$?

Published on 17 Mar 2021 - 12:49

score 104 · Answer 13 · 2026-03-29 17:25:51

104

Views

Represent regular languages and automata having more than 26 symbols in their alphabet

Published on 29 Mar 2026 - 17:25

score 436 · Answer 14 · 2026-03-28 08:49:34

436

Views

How to provide a regular grammar equivalent to context-free grammar?

Published on 28 Mar 2026 - 8:49

score 101 · Answer 15 · 2021-03-29 16:11:02

101

Views

$L_1$ is regular and $L_2$ is not. What can i say about their union or intersection?

Published on 29 Mar 2021 - 16:11

List Question

Prove $\{0^k10^k10^k1 \in \{0,1\}^* \mid k \geq 0 \}$ is not context free

Prove or disprove: If $A$ and $A ∩ B$ are regular, then $B$ is regular.

Prove or disprove: If $A$ is regular and $A ∩ B$ is not regular, then $B$ is not regular.

Prove or disprove: If $A$ is regular and $B$ is not regular, then $A ∩ B$ is not regular.

Prove that the language $A= \left \{ x\in\left \{ 0, 1 \right \}^{*}\mid\#\left ( 0, x \right )= \#\left ( 1, x \right ) \right \}$ is not regular.

Write an NFA with only four states

Automata | Proving that if $L$ is regular then $L'$ (word in $L'$ is a word from $L$ without the first and the last letter) is regular too.

Show that $A=\{0^m 1^n |\text{ }m\text{ is even or }m > n\}$ has infinitely many equivalence classes to prove non-regularity.

Show that $A=\{0^k 1^m 0^n |\text{ }n=k+m\}$ has infinitely many equivalence classes.

questions about the pumping lemma

$L^2$ = $L$ equality implications for a formal language

What's the purpose of the word $w$ in the proof for $ L \in \mathsf{REG} \implies L(\varphi) \in \mathsf{MSO}$ with $L(\varphi) = L$?

Represent regular languages and automata having more than 26 symbols in their alphabet

How to provide a regular grammar equivalent to context-free grammar?

$L_1$ is regular and $L_2$ is not. What can i say about their union or intersection?

Trending Questions

Popular # Hahtags

Popular Questions