List questions from regular-language

Published on 29 Dec 2020 - 0:33

1k

Views

Pumping Lemma proof $L= \{a^nb^m2^{n*m} \mid m,n \ge 0 \} $ not regular

Published on 25 Mar 2026 - 18:47

95

Views

Myhill-Nerode on a language of all binary strings whose last two symbols are the same

Published on 08 Jan 2021 - 16:54

213

Views

Prove regular expressions are equal: $0^1(1 + 00^1)^$ is $(0 + 1)^1$

Published on 10 Jan 2021 - 12:15

98

Views

Prove that the language L is regular

Published on 15 Jan 2021 - 9:38

59

Views

Determine whether language L is regular

Published on 15 Jan 2021 - 15:32

34

Views

Automata for a given language

Published on 15 Jan 2021 - 19:47

588

Views

Is the Pumping Lemma properly applied to prove $L = \{ 0^i1^{i+j}0^i \mid i, j > 0 \}$

Published on 25 Mar 2026 - 18:49

164

Views

Notation Confusion (Specifically: "Such That", & Multiple $\exists$)

Published on 20 Jan 2021 - 12:07

26

Views

Use a proof by contradiction that for any A⊆Σ*, the concatenation A∅ = ∅.

Published on 25 Jan 2021 - 18:50

254

Views

Kleene Star over a formal Language containing Unions

Published on 11 Feb 2021 - 9:05

31

Views

$w = 0001000 \in L'$, but this $w$ is not in $L$?

Published on 17 Feb 2021 - 1:45

812

Views

Pumping Lemma works on language, but language is not regular

Published on 25 Mar 2026 - 18:49

45

Views

How can I prove that this language is context free?

Published on 29 Mar 2026 - 15:32

50

Views

How to prove $\text{if } {B \subseteq A} \implies A^B^ = A^*$

Published on 28 Mar 2026 - 8:49

List Question

Finite Automaton with Binary Multiple Inputs

Pumping Lemma proof $L= \{a^nb^m2^{n*m} \mid m,n \ge 0 \} $ not regular

Myhill-Nerode on a language of all binary strings whose last two symbols are the same

Prove regular expressions are equal: $0^1(1 + 00^1)^$ is $(0 + 1)^1$

Prove that the language L is regular

Determine whether language L is regular

Automata for a given language

Is the Pumping Lemma properly applied to prove $L = \{ 0^i1^{i+j}0^i \mid i, j > 0 \}$

Notation Confusion (Specifically: "Such That", & Multiple $\exists$)

Use a proof by contradiction that for any A⊆Σ*, the concatenation A∅ = ∅.

Kleene Star over a formal Language containing Unions

$w = 0001000 \in L'$, but this $w$ is not in $L$?

Pumping Lemma works on language, but language is not regular

How can I prove that this language is context free?

How to prove $\text{if } {B \subseteq A} \implies A^B^ = A^*$

Trending Questions

Popular # Hahtags

Popular Questions