List questions from regular-expressions

Published on 03 Nov 2018 - 12:49

54

Views

How to write a regular expression over $\{a,b\}$ such that there're at least $3$ occurrences of adjacent different letters?

Published on 04 Nov 2018 - 7:28

2.2k

Views

If RS is equivalent to SR, then RS is equivalent to SR (Proof by Contradiction)

Published on 04 Nov 2018 - 17:53

123

Views

What is the language of this regular expression $0^$ concatenated with $1^ (0^1^$).

Published on 06 Nov 2018 - 1:04

49

Views

Show that $R^{+} \equiv R \leftrightarrow L(RR) \subset L(R)$

Published on 08 Nov 2018 - 16:26

83

Views

Let $L_1$ be the language over alphabet $\{0, 1\}$ defined by $L_1 = \{x : \#_{01}(x) \bmod 3 = 0\}$. Give a regular expression that denotes $L_1$

Published on 09 Nov 2018 - 23:41

911

Views

Proving that L is not regular by showing that $\equiv_L$ has infinite index

Published on 18 Mar 2026 - 10:53

97

Views

Proving 2 languages are equal.

Published on 19 Nov 2018 - 5:06

153

Views

Construct a regular expression

Published on 20 Nov 2018 - 1:04

2.3k

Views

Proof for equivalence of two regular expressions

Published on 21 Nov 2018 - 15:31

91

Views

Is there a metric with wildcard?

Published on 21 Nov 2018 - 15:59

1.5k

Views

How to find the equivalence classes of a formal language complement?

Published on 22 Mar 2026 - 8:19

1.1k

Views

Left Linear Grammer to Right Linear Grammer

Published on 28 Nov 2018 - 10:56

180

Views

Regular Expression From a DFA

Published on 01 Dec 2018 - 0:49

905

Views

Regex for bit string containing at least 2 zeros but no consecutive zeros.

Published on 03 Dec 2018 - 19:19

List Question

Inductive Proof With Regular Expression

How to write a regular expression over $\{a,b\}$ such that there're at least $3$ occurrences of adjacent different letters?

If RS is equivalent to SR, then RS is equivalent to SR (Proof by Contradiction)

What is the language of this regular expression $0^$ concatenated with $1^ (0^1^$).

Show that $R^{+} \equiv R \leftrightarrow L(RR) \subset L(R)$

Let $L_1$ be the language over alphabet $\{0, 1\}$ defined by $L_1 = \{x : \#_{01}(x) \bmod 3 = 0\}$. Give a regular expression that denotes $L_1$

Proving that L is not regular by showing that $\equiv_L$ has infinite index

Proving 2 languages are equal.

Construct a regular expression

Proof for equivalence of two regular expressions

Is there a metric with wildcard?

How to find the equivalence classes of a formal language complement?

Left Linear Grammer to Right Linear Grammer

Regular Expression From a DFA

Regex for bit string containing at least 2 zeros but no consecutive zeros.

Trending Questions

Popular # Hahtags

Popular Questions