Question

Completion of a partial drawing of NFA

score 47 · Answer 1 · 2021-07-14 20:23:54

47

Views

Completion of a partial drawing of NFA

Published on 14 Jul 2021 - 20:23

score 439 · Answer 2 · 2026-03-28 01:26:21

439

Views

How many words of length $k$ are there such that no symbol in the alphabet $\Sigma$ occur exactly once?

Published on 28 Mar 2026 - 1:26

score 656 · Answer 3 · 2026-04-02 20:17:14

656

Views

Proving language from Hamming Distance is regular

Published on 02 Apr 2026 - 20:17

score 129 · Answer 4 · 2021-08-20 15:01:14

129

Views

A Problem from Pinter Abstract Algebra

Published on 20 Aug 2021 - 15:01

score 143 · Answer 5 · 2026-03-29 18:30:33

143

Views

proof / disproof of context-free language

Published on 29 Mar 2026 - 18:30

score 402 · Answer 6 · 2021-09-12 16:57:24

402

Views

What’s the difference between concatenation and cross product of any 2 languages in finite automata?

Published on 12 Sep 2021 - 16:57

score 173 · Answer 7 · 2026-03-28 10:36:02

173

Views

Regular expression for language recognized by NFA?

Published on 28 Mar 2026 - 10:36

score 782 · Answer 8 · 2021-09-20 18:36:59

782

Views

How to write the set builder notation for this DFA.

Published on 20 Sep 2021 - 18:36

score 115 · Answer 9 · 2026-03-26 03:11:14

115

Views

Is $a^n b^n$ context free even if we take strings instead of characters?

Published on 26 Mar 2026 - 3:11

score 241 · Answer 10 · 2026-03-26 04:52:41

241

Views

Combination of 2 context free grammars

Published on 26 Mar 2026 - 4:52

score 105 · Answer 11 · 2026-04-02 21:50:24

105

Views

How do i start this inductive proof on Languages? $| L_1L_2 |$ = $| L_1 |$ $| L_2 |$

Published on 02 Apr 2026 - 21:50

score 199 · Answer 12 · 2026-04-02 21:52:15

199

Views

Let $L = \{w \in \{a,b\}^* \mid \text{$\#_a(w)$ is odd and $\#_b(w)$ is even}\}$. Prove that $L^*$ is the set of strings where $\#_b(w)$ is even.

Published on 02 Apr 2026 - 21:52

score 116 · Answer 13 · 2026-03-25 20:13:52

116

Views

Is it true that for every regular language $L \subseteq \{0, 1\}^{*}$ the language $\{w^{|w|} |w \in L \}$ is also regular?

Published on 25 Mar 2026 - 20:13

score 126 · Answer 14 · 2026-03-25 03:07:33

126

Views

What is the interpretation of Presburger Arithmetic in WS1S?

Published on 25 Mar 2026 - 3:07

score 404 · Answer 15 · 2026-03-28 12:14:03

404

Views

If $$ is regular, will $L' = \{v\in L:\,\exists w\in L: w = v^R\}$ be regular also?

Published on 28 Mar 2026 - 12:14

List Question

Completion of a partial drawing of NFA

How many words of length $k$ are there such that no symbol in the alphabet $\Sigma$ occur exactly once?

Proving language from Hamming Distance is regular

A Problem from Pinter Abstract Algebra

proof / disproof of context-free language

What’s the difference between concatenation and cross product of any 2 languages in finite automata?

Regular expression for language recognized by NFA?

How to write the set builder notation for this DFA.

Is $a^n b^n$ context free even if we take strings instead of characters?

Combination of 2 context free grammars

How do i start this inductive proof on Languages? $| L_1L_2 |$ = $| L_1 |$ $| L_2 |$

Let $L = \{w \in \{a,b\}^* \mid \text{$\#_a(w)$ is odd and $\#_b(w)$ is even}\}$. Prove that $L^*$ is the set of strings where $\#_b(w)$ is even.

Is it true that for every regular language $L \subseteq \{0, 1\}^{*}$ the language $\{w^{|w|} |w \in L \}$ is also regular?

What is the interpretation of Presburger Arithmetic in WS1S?

If $$ is regular, will $L' = \{v\in L:\,\exists w\in L: w = v^R\}$ be regular also?

Trending Questions

Popular # Hahtags

Popular Questions