List questions from regular-expressions

Published on 08 Mar 2026 - 3:48

7.5k

Views

Regular expressions with empty set/empty string

Published on 29 Oct 2015 - 18:03

271

Views

how to solve equation with epsilon

Published on 26 Mar 2026 - 4:35

16.9k

Views

Regular expression for language containing all strings that start and end with different symbols

Published on 26 Mar 2026 - 2:59

65

Views

Regular language or not : XAB where X,A belongs to (0,1)+

Published on 26 Mar 2026 - 4:32

38

Views

Which automata recognizes the language defined by the regular expression

Published on 05 Nov 2015 - 9:18

1.8k

Views

Prove that the Language $L= \{ 0^n1^m \;|\; n,m \ge 0 \}$ is regular

Published on 06 Nov 2015 - 12:34

61

Views

Evaluating $b^a^\cap a^b^$ to a minimal regular expression

Published on 15 Nov 2015 - 3:41

2.4k

Views

Intersection of two languages

Published on 15 Nov 2015 - 7:04

2.7k

Views

Regular expression for string's of a's and b's beginning with b and not having two consecutive a's

Published on 17 Nov 2015 - 18:28

400

Views

Prove that $L = \{0^n1^m \mid n ≥ 10, m ≤ 50\}$ is regular and that any subset of it is regular

Published on 26 Mar 2026 - 3:01

575

Views

Subset in a regular expression

Published on 19 Nov 2015 - 21:04

398

Views

Regular Expression definitions, as a rule, what is always true?

Published on 20 Nov 2015 - 3:09

20.8k

Views

Automata | Prove that if $L$ is regular than $half(L)$ is regular too

Published on 21 Nov 2015 - 13:39

224

Views

L = {s∈(0+1)* | for every prefix s' of s, $\mid n_{0}(s')-n_{1}(s') \mid \leq 2 $} is regular?

Published on 22 Nov 2015 - 11:16

List Question

How to determine if a word in $\Sigma^*$ is in a language?

Regular expressions with empty set/empty string

how to solve equation with epsilon

Regular expression for language containing all strings that start and end with different symbols

Regular language or not : XAB where X,A belongs to (0,1)+

Which automata recognizes the language defined by the regular expression

Prove that the Language $L= \{ 0^n1^m \;|\; n,m \ge 0 \}$ is regular

Evaluating $b^a^\cap a^b^$ to a minimal regular expression

Intersection of two languages

Regular expression for string's of a's and b's beginning with b and not having two consecutive a's

Prove that $L = \{0^n1^m \mid n ≥ 10, m ≤ 50\}$ is regular and that any subset of it is regular

Subset in a regular expression

Regular Expression definitions, as a rule, what is always true?

Automata | Prove that if $L$ is regular than $half(L)$ is regular too

L = {s∈(0+1)* | for every prefix s' of s, $\mid n_{0}(s')-n_{1}(s') \mid \leq 2 $} is regular?

Trending Questions

Popular # Hahtags

Popular Questions