Question

How to proof regular/non-regular with Nerode Theorem

score 40 · Answer 1 · 2026-04-11 22:11:54

40

Views

How to proof regular/non-regular with Nerode Theorem

Published on 11 Apr 2026 - 22:11

score 141 · Answer 2 · 2026-04-11 07:00:18

141

Views

What does the "\" mean in this statement about regular languages?

Published on 11 Apr 2026 - 7:00

score 530 · Answer 3 · 2026-05-11 03:17:08

530

Views

How can I prove that all strings in {0, 1} * that contain any palindrome of length at least 6 as a substring is regular?

Published on 11 May 2026 - 3:17

score 44 · Answer 4 · 2026-04-15 12:12:43

44

Views

Please help me understand these kind of Regular Expressions design

Published on 15 Apr 2026 - 12:12

score 181 · Answer 5 · 2026-04-15 05:21:41

181

Views

Is any anagram of the empty language the same as the empty language?

Published on 15 Apr 2026 - 5:21

score 86 · Answer 6 · 2026-04-16 15:58:28

86

Views

Prove $(L^)^=L^*$

Published on 16 Apr 2026 - 15:58

score 817 · Answer 7 · 2026-04-13 00:18:26

817

Views

Are regular expressions sets?

Published on 13 Apr 2026 - 0:18

score 1k · Answer 8 · 2026-04-12 21:52:56

1k

Views

Showing that the language of prefixes $\operatorname{pre}\mathcal L$ is regular by using the definition of a regular language

Published on 12 Apr 2026 - 21:52

score 472 · Answer 9 · 2026-04-13 01:39:42

472

Views

Defining prefixes for regular expressions

Published on 13 Apr 2026 - 1:39

score 189 · Answer 10 · 2026-04-13 10:11:50

189

Views

A bijection between all regular expressions of alphabet $\Sigma$ and the natural numbers $\mathbb N$

Published on 13 Apr 2026 - 10:11

score 306 · Answer 11 · 2026-04-15 01:42:29

306

Views

Converting a regular expression to its complement via automata

Published on 15 Apr 2026 - 1:42

score 133 · Answer 12 · 2026-04-12 18:00:15

133

Views

What is the regular expression of the language accepted by the following NFA?

Published on 12 Apr 2026 - 18:00

score 52 · Answer 13 · 2026-04-14 18:36:49

52

Views

equivalence of regular expression: $L(\alpha\emptyset) = L(\emptyset)$

Published on 14 Apr 2026 - 18:36

score 47 · Answer 14 · 2026-04-11 22:35:59

47

Views

Regular expression without subword 000

Published on 11 Apr 2026 - 22:35

score 137 · Answer 15 · 2026-05-11 03:06:32

137

Views

Kleene closure of a disjunctive normal form for regular expressions

Published on 11 May 2026 - 3:06

List Question

How to proof regular/non-regular with Nerode Theorem

What does the "\" mean in this statement about regular languages?

How can I prove that all strings in {0, 1} * that contain any palindrome of length at least 6 as a substring is regular?

Please help me understand these kind of Regular Expressions design

Is any anagram of the empty language the same as the empty language?

Prove $(L^)^=L^*$

Are regular expressions sets?

Showing that the language of prefixes $\operatorname{pre}\mathcal L$ is regular by using the definition of a regular language

Defining prefixes for regular expressions

A bijection between all regular expressions of alphabet $\Sigma$ and the natural numbers $\mathbb N$

Converting a regular expression to its complement via automata

What is the regular expression of the language accepted by the following NFA?

equivalence of regular expression: $L(\alpha\emptyset) = L(\emptyset)$

Regular expression without subword 000

Kleene closure of a disjunctive normal form for regular expressions

Trending Questions

Popular # Hahtags

Popular Questions