Question

Does the Kleene Star allow for n-time concatenation or infinite concatenation of a word with itself?

score 297 · Answer 1 · 2026-03-28 10:41:26

297

Views

Does the Kleene Star allow for n-time concatenation or infinite concatenation of a word with itself?

Published on 28 Mar 2026 - 10:41

score 76 · Answer 2 · 2021-05-16 20:05:04

76

Views

Show that the class of regular languages is closed under gapping

Published on 16 May 2021 - 20:05

score 561 · Answer 3 · 2021-05-17 18:18:00

561

Views

Substring of a regular language

Published on 17 May 2021 - 18:18

score 1k · Answer 4 · 2026-03-28 10:41:45

1k

Views

What is the regular expression representing all binary strings where no occurrence of 00 is immediately followed by a 1?

Published on 28 Mar 2026 - 10:41

score 2.4k · Answer 5 · 2026-03-29 18:36:25

2.4k

Views

What is the context-free grammar representing the set of all binary strings that contain at least one $1$ and at most two $0$’s?

Published on 29 Mar 2026 - 18:36

score 253 · Answer 6 · 2026-02-23 08:23:26

253

Views

If L is regular, then $L \setminus \{ \epsilon \}$ is regular.

Published on 23 Feb 2026 - 8:23

score 293 · Answer 7 · 2026-03-28 10:40:39

293

Views

Is the Kleene Star $*$ distributive over concatenation?

Published on 28 Mar 2026 - 10:40

score 317 · Answer 8 · 2026-03-28 10:35:26

317

Views

Does there exist a set of strings $L \subseteq 1^*$ such that $L$ is an irregular language?

Published on 28 Mar 2026 - 10:35

score 308 · Answer 9 · 2026-02-23 08:28:29

308

Views

Prove\Disprove: If $L_1$ is not a CFL, and $L_2$ is finite, then $L_1 \cup L_2$ is not a CFL.

Published on 23 Feb 2026 - 8:28

score 478 · Answer 10 · 2026-03-28 14:07:42

478

Views

Give the regular expression for the set of strings $\{a, b, c\}$ that do not contain substring $aa$

Published on 28 Mar 2026 - 14:07

score 272 · Answer 11 · 2021-06-27 13:33:26

272

Views

Finding maximum size of a finite language accepted by DFA

Published on 27 Jun 2021 - 13:33

score 118 · Answer 12 · 2026-03-28 10:40:32

118

Views

Simplify $R:=0^+0^1\left(1+000^1\right)^0^*$

Published on 28 Mar 2026 - 10:40

score 192 · Answer 13 · 2021-06-30 06:53:05

192

Views

Using pumping lemma to prove that $L=\{ab^nab^k \mid n>k>3\}$ is not regular

Published on 30 Jun 2021 - 6:53

score 83 · Answer 14 · 2026-03-28 10:35:22

83

Views

Function from natural to lexicographically ordered words of a-z

Published on 28 Mar 2026 - 10:35

score 655 · Answer 15 · 2021-07-26 15:29:51

655

Views

Proving language from Hamming Distance is regular

Published on 26 Jul 2021 - 15:29

List Question

Does the Kleene Star allow for n-time concatenation or infinite concatenation of a word with itself?

Show that the class of regular languages is closed under gapping

Substring of a regular language

What is the regular expression representing all binary strings where no occurrence of 00 is immediately followed by a 1?

What is the context-free grammar representing the set of all binary strings that contain at least one $1$ and at most two $0$’s?

If L is regular, then $L \setminus \{ \epsilon \}$ is regular.

Is the Kleene Star $*$ distributive over concatenation?

Does there exist a set of strings $L \subseteq 1^*$ such that $L$ is an irregular language?

Prove\Disprove: If $L_1$ is not a CFL, and $L_2$ is finite, then $L_1 \cup L_2$ is not a CFL.

Give the regular expression for the set of strings $\{a, b, c\}$ that do not contain substring $aa$

Finding maximum size of a finite language accepted by DFA

Simplify $R:=0^+0^1\left(1+000^1\right)^0^*$

Using pumping lemma to prove that $L=\{ab^nab^k \mid n>k>3\}$ is not regular

Function from natural to lexicographically ordered words of a-z

Proving language from Hamming Distance is regular

Trending Questions

Popular # Hahtags

Popular Questions