Question

Kleene Star over a formal Language containing Unions

score 255 · Answer 1 · 2026-04-02 14:49:42

255

Views

Kleene Star over a formal Language containing Unions

Published on 02 Apr 2026 - 14:49

score 43 · Answer 2 · 2026-04-04 16:18:03

43

Views

$01^01^(0 \lor 1)^* \lor 10^10^1(0 \lor 1)^*$ is wrong

Published on 04 Apr 2026 - 16:18

score 34 · Answer 3 · 2026-04-04 16:16:33

34

Views

$(a \lor b) a a^(a \lor a a^b) \lor (a \lor b)aa^aa^$ is wrong?

Published on 04 Apr 2026 - 16:16

score 74 · Answer 4 · 2026-04-02 12:22:26

74

Views

How can any sentence be valid?

Published on 02 Apr 2026 - 12:22

score 50 · Answer 5 · 2026-03-28 08:49:01

50

Views

How to prove $\text{if } {B \subseteq A} \implies A^B^ = A^*$

Published on 28 Mar 2026 - 8:49

score 1.8k · Answer 6 · 2026-04-02 16:26:18

1.8k

Views

Prove or disprove: If $A$ and $A ∩ B$ are regular, then $B$ is regular.

Published on 02 Apr 2026 - 16:26

score 455 · Answer 7 · 2026-04-02 16:38:07

455

Views

Prove or disprove: If $A$ is regular and $A ∩ B$ is not regular, then $B$ is not regular.

Published on 02 Apr 2026 - 16:38

score 934 · Answer 8 · 2026-04-02 16:38:08

934

Views

Prove or disprove: If $A$ is regular and $B$ is not regular, then $A ∩ B$ is not regular.

Published on 02 Apr 2026 - 16:38

score 91 · Answer 9 · 2021-03-01 14:33:34

91

Views

Expressing the statement "The equation $x^2 + 2x = 15$ has a unique solution." in formal language.

Published on 01 Mar 2021 - 14:33

score 119 · Answer 10 · 2026-04-04 16:18:24

119

Views

$B = \{w \mid w = xbaby,\text{ where }x, y \in \Sigma^*\}, \Sigma = \{a, b\}$ - DFA

Published on 04 Apr 2026 - 16:18

score 145 · Answer 11 · 2026-03-29 15:31:11

145

Views

Design CFG for language

Published on 29 Mar 2026 - 15:31

score 77 · Answer 12 · 2026-03-29 15:31:14

77

Views

CFG for a Language

Published on 29 Mar 2026 - 15:31

score 174 · Answer 13 · 2026-03-28 08:51:11

174

Views

Prove that the language $A= \left \{ x\in\left \{ 0, 1 \right \}^{*}\mid\#\left ( 0, x \right )= \#\left ( 1, x \right ) \right \}$ is not regular.

Published on 28 Mar 2026 - 8:51

score 55 · Answer 14 · 2026-03-29 15:33:24

55

Views

What is the formal definition of LR grammar and how to prove it is not ambiguous?

Published on 29 Mar 2026 - 15:33

score 140 · Answer 15 · 2026-03-29 15:32:19

140

Views

How to define a Parse Tree, and the equality of parse tree?

Published on 29 Mar 2026 - 15:32

List Question

Kleene Star over a formal Language containing Unions

$01^01^(0 \lor 1)^* \lor 10^10^1(0 \lor 1)^*$ is wrong

$(a \lor b) a a^(a \lor a a^b) \lor (a \lor b)aa^aa^$ is wrong?

How can any sentence be valid?

How to prove $\text{if } {B \subseteq A} \implies A^B^ = A^*$

Prove or disprove: If $A$ and $A ∩ B$ are regular, then $B$ is regular.

Prove or disprove: If $A$ is regular and $A ∩ B$ is not regular, then $B$ is not regular.

Prove or disprove: If $A$ is regular and $B$ is not regular, then $A ∩ B$ is not regular.

Expressing the statement "The equation $x^2 + 2x = 15$ has a unique solution." in formal language.

$B = \{w \mid w = xbaby,\text{ where }x, y \in \Sigma^*\}, \Sigma = \{a, b\}$ - DFA

Design CFG for language

CFG for a Language

Prove that the language $A= \left \{ x\in\left \{ 0, 1 \right \}^{*}\mid\#\left ( 0, x \right )= \#\left ( 1, x \right ) \right \}$ is not regular.

What is the formal definition of LR grammar and how to prove it is not ambiguous?

How to define a Parse Tree, and the equality of parse tree?

Trending Questions

Popular # Hahtags

Popular Questions