Question

Equivalence relation ≈L, for L ⊆ Σ*. Find u ≈L1 v and u !≈L2 v.

score 276 · Answer 1 · 2020-10-23 21:32:29

276

Views

Equivalence relation ≈L, for L ⊆ Σ*. Find u ≈L1 v and u !≈L2 v.

Published on 23 Oct 2020 - 21:32

score 73 · Answer 2 · 2026-03-28 05:20:43

73

Views

Trouble undestanding regular expression

Published on 28 Mar 2026 - 5:20

score 71 · Answer 3 · 2026-03-28 05:20:49

71

Views

Is this considered a regular expression?

Published on 28 Mar 2026 - 5:20

score 1.3k · Answer 4 · 2026-03-28 05:29:00

1.3k

Views

Regular expression for all strings with even length and not containing “ab” and “ba”

Published on 28 Mar 2026 - 5:29

score 72 · Answer 5 · 2020-11-04 11:17:00

72

Views

Prove $010010001...0^i1$ is irregular without using pumping lemma

Published on 04 Nov 2020 - 11:17

score 329 · Answer 6 · 2026-03-25 17:22:23

329

Views

Pumping Lemma proof, need help with splitting xyz word, choosing pumping length and proving its not regular

Published on 25 Mar 2026 - 17:22

score 96 · Answer 7 · 2020-11-09 22:12:36

96

Views

Proving a language is regular through the reverse language

Published on 09 Nov 2020 - 22:12

score 37 · Answer 8 · 2026-03-28 05:20:54

37

Views

Describe regular language

Published on 28 Mar 2026 - 5:20

score 93 · Answer 9 · 2026-03-28 05:28:47

93

Views

What is the probability that a random regular expression defines the language of all binary strings $\{0, 1\}^*$?

Published on 28 Mar 2026 - 5:28

score 97 · Answer 10 · 2020-12-10 21:58:57

97

Views

Converting DFA to Regex

Published on 10 Dec 2020 - 21:58

score 46 · Answer 11 · 2020-12-14 02:17:13

46

Views

Theorical question about union of two regular languages

Published on 14 Dec 2020 - 2:17

score 156 · Answer 12 · 2020-12-22 13:46:52

156

Views

The proof that L is not regular language

Published on 22 Dec 2020 - 13:46

score 2k · Answer 13 · 2020-12-25 10:56:48

2k

Views

Prove that, if L is regular, $P(L) = \{ w \in L\text{ } |\text{for any prefix } w' \text{ of w, } w' \in L\}$ is regular

Published on 25 Dec 2020 - 10:56

score 1.4k · Answer 14 · 2020-12-27 17:28:35

1.4k

Views

How to prove that the language of Non-palindromes is not regular (via pumping lemma)

Published on 27 Dec 2020 - 17:28

score 184 · Answer 15 · 2026-03-28 05:20:36

184

Views

Regular Expressions Theory Questions

Published on 28 Mar 2026 - 5:20

List Question

Equivalence relation ≈L, for L ⊆ Σ*. Find u ≈L1 v and u !≈L2 v.

Trouble undestanding regular expression

Is this considered a regular expression?

Regular expression for all strings with even length and not containing “ab” and “ba”

Prove $010010001...0^i1$ is irregular without using pumping lemma

Pumping Lemma proof, need help with splitting xyz word, choosing pumping length and proving its not regular

Proving a language is regular through the reverse language

Describe regular language

What is the probability that a random regular expression defines the language of all binary strings $\{0, 1\}^*$?

Converting DFA to Regex

Theorical question about union of two regular languages

The proof that L is not regular language

Prove that, if L is regular, $P(L) = \{ w \in L\text{ } |\text{for any prefix } w' \text{ of w, } w' \in L\}$ is regular

How to prove that the language of Non-palindromes is not regular (via pumping lemma)

Regular Expressions Theory Questions

Trending Questions

Popular # Hahtags

Popular Questions