Question

Pumping lemma definition!

score 80 · Answer 1 · 2026-03-25 18:45:09

80

Views

Pumping lemma definition!

Published on 25 Mar 2026 - 18:45

score 174 · Answer 2 · 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 3 · 2026-03-28 08:48:06

230

Views

Write an NFA with only four states

Published on 28 Mar 2026 - 8:48

score 48 · Answer 4 · 2026-03-25 12:47:11

48

Views

Why is this language regular?

Published on 25 Mar 2026 - 12:47

score 37 · Answer 5 · 2026-02-24 05:22:53

37

Views

Create PDA for Language

Published on 24 Feb 2026 - 5:22

score 157 · Answer 6 · 2026-04-02 16:35:40

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 189 · Answer 7 · 2021-03-08 10:27:09

189

Views

What language is accepted by the following dfa (english)?

Published on 08 Mar 2021 - 10:27

score 384 · Answer 8 · 2026-04-03 07:49:48

384

Views

Interesting behavior of the $2$-tag system $\{a\rightarrow abc,b\rightarrow ab,c\rightarrow c\}$

Published on 03 Apr 2026 - 7:49

score 37 · Answer 9 · 2026-04-02 16:31:07

37

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 02 Apr 2026 - 16:31

score 34 · Answer 10 · 2026-04-02 16:38:06

34

Views

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

Published on 02 Apr 2026 - 16:38

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

194

Views

questions about the pumping lemma

Published on 25 Mar 2026 - 18:45

score 859 · Answer 12 · 2021-03-12 14:27:03

859

Views

DFA for strings not containing aaa as substring and must contain aa as sufix

Published on 12 Mar 2021 - 14:27

score 1.4k · Answer 13 · 2026-03-29 19:49:09

1.4k

Views

Prove that the set of Turing-decidable languages are closed under union.

Published on 29 Mar 2026 - 19:49

score 663 · Answer 14 · 2026-03-29 19:52:40

663

Views

Prove that the set of Turing-decidable languages are closed under reversal.

Published on 29 Mar 2026 - 19:52

score 87 · Answer 15 · 2021-03-16 00:23:36

87

Views

What is the relationship between the language accepted by DFA $M_1$ and the language accepted by DFA $M$?

Published on 16 Mar 2021 - 0:23

List Question

Pumping lemma definition!

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

Why is this language regular?

Create PDA for Language

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.

What language is accepted by the following dfa (english)?

Interesting behavior of the $2$-tag system $\{a\rightarrow abc,b\rightarrow ab,c\rightarrow c\}$

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

DFA for strings not containing aaa as substring and must contain aa as sufix

Prove that the set of Turing-decidable languages are closed under union.

Prove that the set of Turing-decidable languages are closed under reversal.

What is the relationship between the language accepted by DFA $M_1$ and the language accepted by DFA $M$?

Trending Questions

Popular # Hahtags

Popular Questions