List questions from regular-expressions

Published on 16 Jul 2017 - 21:02

11.7k

Views

Example of language that does not contain substring $11$

Published on 26 Mar 2026 - 13:49

547

Views

Finding a regex/DFSA

Published on 27 Mar 2026 - 0:57

48.2k

Views

DFA that accepts strings where there are odd number of 1's, and any number of 0's

Published on 26 Mar 2026 - 13:52

628

Views

How do I simplify this regex?

Published on 20 Jul 2017 - 4:01

781

Views

What is the regex of the following FSA?

Published on 20 Jul 2017 - 22:11

1.7k

Views

Give a language L over alphabet $\{0,1\}$ such that the following criteria are met:

Published on 26 Mar 2026 - 17:14

134

Views

If $R\equiv RR$, then $R\equiv \emptyset\text { or } R\equiv \epsilon\text{ or } L(R)\text{ is infinite}$

Published on 02 Aug 2017 - 17:12

95

Views

Give a language $L$ over $\{0,1\}$ such that the following criteria are met:

Published on 26 Mar 2026 - 17:14

51

Views

Proving that the next language is regular

Published on 05 Aug 2017 - 5:19

99

Views

Context Free Grammar and regexp

Published on 22 Aug 2017 - 19:58

602

Views

How does one come up with regular expressions?

Published on 01 Sep 2017 - 21:54

2.4k

Views

how to reduce DFA to NFA with less states

Published on 26 Mar 2026 - 17:12

522

Views

Converting DFA to Regular Expression (DFA final state is the empty set)

Published on 26 Mar 2026 - 17:18

9.4k

Views

Regular expression $(A^B^)^* = (A+B)^*$ proof

Published on 09 Oct 2017 - 23:01

List Question

Give a regex that matches this specific language:

Example of language that does not contain substring $11$

Finding a regex/DFSA

DFA that accepts strings where there are odd number of 1's, and any number of 0's

How do I simplify this regex?

What is the regex of the following FSA?

Give a language L over alphabet $\{0,1\}$ such that the following criteria are met:

If $R\equiv RR$, then $R\equiv \emptyset\text { or } R\equiv \epsilon\text{ or } L(R)\text{ is infinite}$

Give a language $L$ over $\{0,1\}$ such that the following criteria are met:

Proving that the next language is regular

Context Free Grammar and regexp

How does one come up with regular expressions?

how to reduce DFA to NFA with less states

Converting DFA to Regular Expression (DFA final state is the empty set)

Regular expression $(A^B^)^* = (A+B)^*$ proof

Trending Questions

Popular # Hahtags

Popular Questions