Question

Minimum DFA's number of states accepting strings whose length is not a multiple of 9 based on an alphabeth composed by 4 symbols

score 126 · Answer 1 · 2021-02-09 20:59:39

Minimum DFA's number of states accepting strings whose length is not a multiple of 9 based on an alphabeth composed by 4 symbols

score 609 · Answer 2 · 2026-04-03 06:18:52

609

Views

What is the language recognized by the finite automaton?

Published on 03 Apr 2026 - 6:18

score 97 · Answer 3 · 2021-02-12 17:10:14

97

Views

NFA to DFA Conversion Help

Published on 12 Feb 2021 - 17:10

score 208 · Answer 4 · 2021-02-15 19:47:31

208

Views

alphabet $\{0, 1\}$, the set of non-empty words whose first letter occurs at least two other times

Published on 15 Feb 2021 - 19:47

score 42 · Answer 5 · 2021-02-15 21:51:09

42

Views

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

Published on 15 Feb 2021 - 21:51

score 38 · Answer 6 · 2021-02-16 00:52:23

38

Views

Contruct a deterministic automata from a non-deterministic automata

Published on 16 Feb 2021 - 0:52

score 225 · Answer 7 · 2021-02-16 13:10:40

225

Views

If $L$ is regular, then $\hat{L}$ is also regular

Published on 16 Feb 2021 - 13:10

score 33 · Answer 8 · 2021-02-16 19:38:11

33

Views

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

Published on 16 Feb 2021 - 19:38

score 32 · Answer 9 · 2026-04-02 14:49:03

32

Views

$w = 0001000 \in L'$, but this $w$ is not in $L$?

Published on 02 Apr 2026 - 14:49

score 812 · Answer 10 · 2026-03-25 18:49:46

812

Views

Pumping Lemma works on language, but language is not regular

Published on 25 Mar 2026 - 18:49

score 50 · Answer 11 · 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 12 · 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 13 · 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 14 · 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 118 · Answer 15 · 2021-03-02 20:05:46

118

Views

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

Published on 02 Mar 2021 - 20:05

List Question

Minimum DFA's number of states accepting strings whose length is not a multiple of 9 based on an alphabeth composed by 4 symbols

What is the language recognized by the finite automaton?

NFA to DFA Conversion Help

alphabet $\{0, 1\}$, the set of non-empty words whose first letter occurs at least two other times

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

Contruct a deterministic automata from a non-deterministic automata

If $L$ is regular, then $\hat{L}$ is also regular

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

$w = 0001000 \in L'$, but this $w$ is not in $L$?

Pumping Lemma works on language, but language is not regular

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.

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

Trending Questions

Popular # Hahtags

Popular Questions