Question

Minimum length regular expression for $\{ w| w\in\{0,1\}^* $ and for every x that is a prefix of w, $|\#1(x)-\#0(x)| \leq2\}$

score 192 · Answer 1 · 2021-04-26 08:27:51

192

Views

Minimum length regular expression for $\{ w| w\in\{0,1\}^* $ and for every x that is a prefix of w, $|\#1(x)-\#0(x)| \leq2\}$

Published on 26 Apr 2021 - 8:27

score 2.1k · Answer 2 · 2021-04-27 04:32:01

2.1k

Views

Regular expression for {$w:w$ starts with $0$ and has odd length, or starts with $1$ and has even length}

Published on 27 Apr 2021 - 4:32

score 503 · Answer 3 · 2021-04-28 21:17:38

503

Views

convert from dfa to regex

Published on 28 Apr 2021 - 21:17

score 287 · Answer 4 · 2021-04-29 13:19:53

287

Views

Is $L = \{xwyw^r \mid x,w,y \in (a+b)^+ \}$ regular?

Published on 29 Apr 2021 - 13:19

score 378 · Answer 5 · 2021-05-03 05:52:38

378

Views

NFA of language $1^(001^)^*$

Published on 03 May 2021 - 5:52

score 296 · Answer 6 · 2021-05-09 10:16:25

296

Views

Does the Kleene Star allow for n-time concatenation or infinite concatenation of a word with itself?

Published on 09 May 2021 - 10:16

score 1k · Answer 7 · 2021-05-19 04:07:08

1k

Views

What is the regular expression representing all binary strings where no occurrence of 00 is immediately followed by a 1?

Published on 19 May 2021 - 4:07

score 292 · Answer 8 · 2021-06-06 03:54:30

292

Views

Is the Kleene Star $*$ distributive over concatenation?

Published on 06 Jun 2021 - 3:54

score 316 · Answer 9 · 2021-06-08 19:52:43

316

Views

Does there exist a set of strings $L \subseteq 1^*$ such that $L$ is an irregular language?

Published on 08 Jun 2021 - 19:52

score 476 · Answer 10 · 2021-06-19 18:00:18

476

Views

Give the regular expression for the set of strings $\{a, b, c\}$ that do not contain substring $aa$

Published on 19 Jun 2021 - 18:00

score 117 · Answer 11 · 2021-06-29 20:28:23

117

Views

Simplify $R:=0^+0^1\left(1+000^1\right)^0^*$

Published on 29 Jun 2021 - 20:28

score 82 · Answer 12 · 2021-07-02 20:44:26

82

Views

Function from natural to lexicographically ordered words of a-z

Published on 02 Jul 2021 - 20:44

score 37 · Answer 13 · 2021-08-30 07:12:30

37

Views

Trying to simplify a regular expression of which I currently have an abominably long one

Published on 30 Aug 2021 - 7:12

score 744 · Answer 14 · 2026-02-24 00:00:25

744

Views

Expressing absolute value intervals in terms of inequalities

Published on 24 Feb 2026 - 0:00

score 172 · Answer 15 · 2021-09-14 14:19:29

172

Views

Regular expression for language recognized by NFA?

Published on 14 Sep 2021 - 14:19

List Question

Minimum length regular expression for $\{ w| w\in\{0,1\}^* $ and for every x that is a prefix of w, $|\#1(x)-\#0(x)| \leq2\}$

Regular expression for {$w:w$ starts with $0$ and has odd length, or starts with $1$ and has even length}

convert from dfa to regex

Is $L = \{xwyw^r \mid x,w,y \in (a+b)^+ \}$ regular?

NFA of language $1^(001^)^*$

Does the Kleene Star allow for n-time concatenation or infinite concatenation of a word with itself?

What is the regular expression representing all binary strings where no occurrence of 00 is immediately followed by a 1?

Is the Kleene Star $*$ distributive over concatenation?

Does there exist a set of strings $L \subseteq 1^*$ such that $L$ is an irregular language?

Give the regular expression for the set of strings $\{a, b, c\}$ that do not contain substring $aa$

Simplify $R:=0^+0^1\left(1+000^1\right)^0^*$

Function from natural to lexicographically ordered words of a-z

Trying to simplify a regular expression of which I currently have an abominably long one

Expressing absolute value intervals in terms of inequalities

Regular expression for language recognized by NFA?

Trending Questions

Popular # Hahtags

Popular Questions