Question

$\{w \in \{ a,b,c,d \}^{*}: |w|\geq 2, w \text{ begins and ends with the same symbol} \}$

score 1k · Answer 1 · 2020-02-01 02:22:50

1k

Views

$\{w \in \{ a,b,c,d \}^{*}: |w|\geq 2, w \text{ begins and ends with the same symbol} \}$

Published on 01 Feb 2020 - 2:22

score 2.3k · Answer 2 · 2020-02-01 02:35:07

2.3k

Views

$\{w \in \{ 0,1 \}^{*}: w \text{ contains both 101 and 010 as substrings} \}$

Published on 01 Feb 2020 - 2:35

score 222 · Answer 3 · 2020-02-02 22:03:40

222

Views

Are all almost regular languages regular?

Published on 02 Feb 2020 - 22:03

score 673 · Answer 4 · 2020-02-12 00:30:05

673

Views

Why can we not directly complement an NFA

Published on 12 Feb 2020 - 0:30

score 205 · Answer 5 · 2020-02-12 00:41:37

205

Views

Why does a translated DFA usually not have $2^n$ states?

Published on 12 Feb 2020 - 0:41

score 69 · Answer 6 · 2020-02-12 18:14:29

69

Views

Proving that $L=\{a^{j}b^{k}\,:\,j,k\geq0\}$ is regular

Published on 12 Feb 2020 - 18:14

score 565 · Answer 7 · 2020-02-13 06:30:52

565

Views

How can I concatenate these two DFA's?

Published on 13 Feb 2020 - 6:30

score 86 · Answer 8 · 2020-02-13 19:08:38

86

Views

Find a finite automata that recognizes $L=\{w\in\{0,1,2\}^*\mid\text{$w$ has one $1$ and odd number of $0$}\}$

Published on 13 Feb 2020 - 19:08

score 74 · Answer 9 · 2020-02-14 20:58:41

74

Views

Proving: $\bigcup_{i=0}^{\infty}\{\epsilon\}=\{\epsilon\}$

Published on 14 Feb 2020 - 20:58

score 107 · Answer 10 · 2026-03-22 06:32:49

107

Views

NFA to DFA Diagram Conversion

Published on 22 Mar 2026 - 6:32

score 673 · Answer 11 · 2020-02-15 03:17:06

Given a (Deterministic Finite Automata) DFA that recognizes a language $L$, show how to construct another DFA that recognizes the language $\max(L)$.

score 139 · Answer 12 · 2026-03-26 03:18:48

139

Views

What does the "\" mean in this statement about regular languages?

Published on 26 Mar 2026 - 3:18

score 36 · Answer 13 · 2020-02-18 21:15:41

36

Views

Automata, operation on languages

Published on 18 Feb 2020 - 21:15

score 42 · Answer 14 · 2026-03-26 03:11:16

42

Views

Please help me understand these kind of Regular Expressions design

Published on 26 Mar 2026 - 3:11

score 77 · Answer 15 · 2020-02-26 07:55:26

77

Views

Find a deterministic finite automaton for the regular paperfolding sequence

Published on 26 Feb 2020 - 7:55

List Question

$\{w \in \{ a,b,c,d \}^{*}: |w|\geq 2, w \text{ begins and ends with the same symbol} \}$

$\{w \in \{ 0,1 \}^{*}: w \text{ contains both 101 and 010 as substrings} \}$

Are all almost regular languages regular?

Why can we not directly complement an NFA

Why does a translated DFA usually not have $2^n$ states?

Proving that $L=\{a^{j}b^{k}\,:\,j,k\geq0\}$ is regular

How can I concatenate these two DFA's?

Find a finite automata that recognizes $L=\{w\in\{0,1,2\}^*\mid\text{$w$ has one $1$ and odd number of $0$}\}$

Proving: $\bigcup_{i=0}^{\infty}\{\epsilon\}=\{\epsilon\}$

NFA to DFA Diagram Conversion

Given a (Deterministic Finite Automata) DFA that recognizes a language $L$, show how to construct another DFA that recognizes the language $\max(L)$.

What does the "\" mean in this statement about regular languages?

Automata, operation on languages

Please help me understand these kind of Regular Expressions design

Find a deterministic finite automaton for the regular paperfolding sequence

Trending Questions

Popular # Hahtags

Popular Questions