Question

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

score 562 · Answer 1 · 2026-04-15 05:35:47

562

Views

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

Published on 15 Apr 2026 - 5:35

score 88 · Answer 2 · 2026-04-14 05:25:14

88

Views

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

Published on 14 Apr 2026 - 5:25

score 104 · Answer 3 · 2026-04-16 02:06:35

104

Views

why is this language regular?(complicated)

Published on 16 Apr 2026 - 2:06

score 136 · Answer 4 · 2026-04-12 01:54:12

136

Views

Is every language with a single letter alphabet is decidable?

Published on 12 Apr 2026 - 1:54

score 73 · Answer 5 · 2026-04-13 04:15:15

73

Views

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

Published on 13 Apr 2026 - 4:15

score 39 · Answer 6 · 2026-05-10 15:10:26

39

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 10 May 2026 - 15:10

score 31 · Answer 7 · 2026-04-30 13:20:32

31

Views

Regular definitions of numbers.

Published on 30 Apr 2026 - 13:20

score 53 · Answer 8 · 2026-05-11 01:43:16

53

Views

Adding trigonometric operations and other operations to context free grammar

Published on 11 May 2026 - 1:43

score 42 · Answer 9 · 2026-05-11 01:38:12

42

Views

Write the pattern based on regular extensions for real numbers.

Published on 11 May 2026 - 1:38

score 399 · Answer 10 · 2026-05-11 03:17:08

399

Views

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

Published on 11 May 2026 - 3:17

score 80 · Answer 11 · 2026-04-12 13:35:25

80

Views

Formal (mathematical) definition of regular languages

Published on 12 Apr 2026 - 13:35

score 87 · Answer 12 · 2026-04-16 08:42:31

87

Views

CFG for $n_b = n_a + n_c$

Published on 16 Apr 2026 - 8:42

score 157 · Answer 13 · 2026-04-13 15:13:00

157

Views

"Kuratowski closure-complement theorem" for formal languages

Published on 13 Apr 2026 - 15:13

score 2.6k · Answer 14 · 2026-05-10 15:09:48

2.6k

Views

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

Published on 10 May 2026 - 15:09

score 132 · Answer 15 · 2026-05-10 12:53:46

132

Views

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

Published on 10 May 2026 - 12:53

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