Question

Describing $\max(L)$ using a regular expression - proper prefix

score 560 · Answer 1 · 2026-03-25 18:44:18

560

Views

Describing $\max(L)$ using a regular expression - proper prefix

Published on 25 Mar 2026 - 18:44

score 86 · Answer 2 · 2026-03-25 07:45:20

86

Views

Is any subset of the naturals a semi-linear set?

Published on 25 Mar 2026 - 7:45

score 102 · Answer 3 · 2026-03-25 20:07:29

102

Views

why is this language regular?(complicated)

Published on 25 Mar 2026 - 20:07

score 133 · Answer 4 · 2019-06-14 13:51:06

133

Views

Is every language with a single letter alphabet is decidable?

Published on 14 Jun 2019 - 13:51

score 71 · Answer 5 · 2026-03-25 20:14:21

71

Views

Is L is the empty set, {$\emptyset$}, is it then true that LL = {$xx \mid x\in L$}?

Published on 25 Mar 2026 - 20:14

score 36 · Answer 6 · 2026-03-25 03:03:18

36

Views

Prove that $L=\left\{ab^{k_1}ab^{k_2}...ab^{k_n}c^m|\forall i:k_i>0\text{ and } m>n>0\right\}$ is not regular using Pumping Lemma

Published on 25 Mar 2026 - 3:03

score 27 · Answer 7 · 2019-06-24 04:25:38

27

Views

Regular definitions of numbers.

Published on 24 Jun 2019 - 4:25

score 50 · Answer 8 · 2026-03-25 07:42:45

50

Views

Adding trigonometric operations and other operations to context free grammar

Published on 25 Mar 2026 - 7:42

score 39 · Answer 9 · 2026-03-25 07:39:55

39

Views

Write the pattern based on regular extensions for real numbers.

Published on 25 Mar 2026 - 7:39

score 396 · Answer 10 · 2026-03-25 07:46:08

396

Views

Is the language over the alphabet {0,1,2} consisting of equal number of substrings "01" and "10" context-free?

Published on 25 Mar 2026 - 7:46

score 77 · Answer 11 · 2019-06-25 17:03:08

77

Views

Formal (mathematical) definition of regular languages

Published on 25 Jun 2019 - 17:03

score 85 · Answer 12 · 2026-03-25 07:42:13

85

Views

CFG for $n_b = n_a + n_c$

Published on 25 Mar 2026 - 7:42

score 155 · Answer 13 · 2019-07-09 09:48:46

155

Views

"Kuratowski closure-complement theorem" for formal languages

Published on 09 Jul 2019 - 9:48

score 2.6k · Answer 14 · 2026-03-25 06:03:20

2.6k

Views

Using pumping lemma to prove that $L:=\{a^{k^3} \mid k\geq 0\}$ is not regular

Published on 25 Mar 2026 - 6:03

score 129 · Answer 15 · 2026-03-25 06:12:22

129

Views

Show that $L(G) = L$ for a given grammar $G$ and language $L$.

Published on 25 Mar 2026 - 6:12

List Question

Describing $\max(L)$ using a regular expression - proper prefix

Is any subset of the naturals a semi-linear set?

why is this language regular?(complicated)

Is every language with a single letter alphabet is decidable?

Is L is the empty set, {$\emptyset$}, is it then true that LL = {$xx \mid x\in L$}?

Prove that $L=\left\{ab^{k_1}ab^{k_2}...ab^{k_n}c^m|\forall i:k_i>0\text{ and } m>n>0\right\}$ is not regular using Pumping Lemma

Regular definitions of numbers.

Adding trigonometric operations and other operations to context free grammar

Write the pattern based on regular extensions for real numbers.

Is the language over the alphabet {0,1,2} consisting of equal number of substrings "01" and "10" context-free?

Formal (mathematical) definition of regular languages

CFG for $n_b = n_a + n_c$

"Kuratowski closure-complement theorem" for formal languages

Using pumping lemma to prove that $L:=\{a^{k^3} \mid k\geq 0\}$ is not regular

Show that $L(G) = L$ for a given grammar $G$ and language $L$.

Trending Questions

Popular # Hahtags

Popular Questions