Question

NFA from regular expression

score 101 · Answer 1 · 2026-03-25 19:00:11

101

Views

NFA from regular expression

Published on 25 Mar 2026 - 19:00

score 989 · Answer 2 · 2026-03-25 20:39:48

989

Views

Right-linear grammar from regular expression

Published on 25 Mar 2026 - 20:39

score 4.3k · Answer 3 · 2013-10-17 18:37:56

4.3k

Views

set of all reg exp vs set of all languages

Published on 17 Oct 2013 - 18:37

score 132 · Answer 4 · 2013-10-17 20:30:31

132

Views

Regarding regular expression. why do the following strings not exist in the expression.

Published on 17 Oct 2013 - 20:30

score 564 · Answer 5 · 2013-10-18 07:14:16

564

Views

L = (aa)(bb) checking if a string belongs to L* but not to L

Published on 18 Oct 2013 - 7:14

score 88 · Answer 6 · 2013-10-18 07:22:52

88

Views

$L = L\bigl((b \cup ab \cup aab)^*(\lambda \cup a \cup aa)\bigr)$ . how does $bbbbbbabaabaa$ belong to L?

Published on 18 Oct 2013 - 7:22

score 73 · Answer 7 · 2013-10-18 07:44:09

73

Views

$L$ is a class of languages that cannot be represented by a regular expression. How to state cardinality of $L$.

Published on 18 Oct 2013 - 7:44

score 538 · Answer 8 · 2013-10-18 20:12:31

538

Views

L is language generated by the context free grammar G = (V, $\Sigma$, P, S)

Published on 18 Oct 2013 - 20:12

score 188 · Answer 9 · 2013-10-27 21:45:17

188

Views

Is $\{w \in \Sigma ^* : |w|_2 mod 4 = 2\}$ a regular language?

Published on 27 Oct 2013 - 21:45

score 2.5k · Answer 10 · 2013-10-28 00:48:55

2.5k

Views

What can be defined as a Regular Set

Published on 28 Oct 2013 - 0:48

score 2.3k · Answer 11 · 2013-10-29 04:22:53

2.3k

Views

Freshening up on discrete math (regular expressions)

Published on 29 Oct 2013 - 4:22

score 491 · Answer 12 · 2013-10-29 09:40:34

491

Views

Regular expression of: $\{ w \in \Sigma^* : w \text{ does not contain the substring 110} \}$.

Published on 29 Oct 2013 - 9:40

score 194 · Answer 13 · 2013-10-29 16:07:47

194

Views

Regular languages that are stutter-invariant but not star-free (LTL/FO-definable)

Published on 29 Oct 2013 - 16:07

score 2.2k · Answer 14 · 2013-10-29 22:12:28

2.2k

Views

Proving that $L= \{a^nb^n, n\ge 0\}$ is not a regular language.

Published on 29 Oct 2013 - 22:12

score 583 · Answer 15 · 2013-10-29 22:29:51

583

Views

Translate from logical formula to regular expression

Published on 29 Oct 2013 - 22:29

List Question

NFA from regular expression

Right-linear grammar from regular expression

set of all reg exp vs set of all languages

Regarding regular expression. why do the following strings not exist in the expression.

L = (aa)(bb) checking if a string belongs to L* but not to L

$L = L\bigl((b \cup ab \cup aab)^*(\lambda \cup a \cup aa)\bigr)$ . how does $bbbbbbabaabaa$ belong to L?

$L$ is a class of languages that cannot be represented by a regular expression. How to state cardinality of $L$.

L is language generated by the context free grammar G = (V, $\Sigma$, P, S)

Is $\{w \in \Sigma ^* : |w|_2 mod 4 = 2\}$ a regular language?

What can be defined as a Regular Set

Freshening up on discrete math (regular expressions)

Regular expression of: $\{ w \in \Sigma^* : w \text{ does not contain the substring 110} \}$.

Regular languages that are stutter-invariant but not star-free (LTL/FO-definable)

Proving that $L= \{a^nb^n, n\ge 0\}$ is not a regular language.

Translate from logical formula to regular expression

Trending Questions

Popular # Hahtags

Popular Questions