Question

Nerode equivalence classes for $ L = \{ a^{n+1}b^m | n,m \geq 0 \text{ and } n+m \text{ is odd} \}$

score 55 · Answer 1 · 2019-11-11 19:35:01

55

Views

Nerode equivalence classes for $ L = \{ a^{n+1}b^m | n,m \geq 0 \text{ and } n+m \text{ is odd} \}$

Published on 11 Nov 2019 - 19:35

score 272 · Answer 2 · 2026-03-26 20:25:46

272

Views

Need clarification on the way a set former is written

Published on 26 Mar 2026 - 20:25

score 47 · Answer 3 · 2019-11-16 21:19:05

47

Views

Giving a regular language $L$ so that $K_L = \{x\,|\,∃y\,|\,(x \sim y \,\land\, y \in L)\}$ is not regular

Published on 16 Nov 2019 - 21:19

score 120 · Answer 4 · 2026-03-25 19:03:59

120

Views

How to prove that a language $K_L$ is context-free based off a regular language $L$

Published on 25 Mar 2026 - 19:03

score 1.4k · Answer 5 · 2026-03-25 22:09:10

1.4k

Views

Proving that languages are regular with pumping lemma

Published on 25 Mar 2026 - 22:09

score 70 · Answer 6 · 2026-03-25 04:40:18

70

Views

Show, that $L$ is not regular but satisfies the pumping-property.

Published on 25 Mar 2026 - 4:40

score 1.6k · Answer 7 · 2026-03-25 19:06:03

1.6k

Views

Concatenation of context-free-language and non-context-free language

Published on 25 Mar 2026 - 19:06

score 58 · Answer 8 · 2026-03-17 14:47:32

58

Views

Is it possible to design a DFA for these languages?

Published on 17 Mar 2026 - 14:47

score 60 · Answer 9 · 2026-03-25 19:01:28

60

Views

Context free grammar for $L$

Published on 25 Mar 2026 - 19:01

score 86 · Answer 10 · 2026-03-25 22:09:16

86

Views

Are the following regular expressions equivalent?

Published on 25 Mar 2026 - 22:09

score 22 · Answer 11 · 2026-03-26 03:09:36

22

Views

Proving regular expression identity

Published on 26 Mar 2026 - 3:09

score 23 · Answer 12 · 2026-03-25 22:05:43

23

Views

Find automata for $S\to01X\mid0S,\;X\to2X\mid1Y,\;Y\to2Y2\mid0$

Published on 25 Mar 2026 - 22:05

score 72 · Answer 13 · 2026-03-27 00:04:43

72

Views

$\mathcal{L}_1 = \{\text{Strings with a 1 at a multiple of 3 from the front}\} $ and ...

Published on 27 Mar 2026 - 0:04

score 402 · Answer 14 · 2026-03-27 06:01:50

402

Views

Grammar for language not ending on "01"

Published on 27 Mar 2026 - 6:01

score 365 · Answer 15 · 2026-03-17 06:01:38

365

Views

How do I prove that this language is regular?

Published on 17 Mar 2026 - 6:01

List Question

Nerode equivalence classes for $ L = \{ a^{n+1}b^m | n,m \geq 0 \text{ and } n+m \text{ is odd} \}$

Need clarification on the way a set former is written

Giving a regular language $L$ so that $K_L = \{x\,|\,∃y\,|\,(x \sim y \,\land\, y \in L)\}$ is not regular

How to prove that a language $K_L$ is context-free based off a regular language $L$

Proving that languages are regular with pumping lemma

Show, that $L$ is not regular but satisfies the pumping-property.

Concatenation of context-free-language and non-context-free language

Is it possible to design a DFA for these languages?

Context free grammar for $L$

Are the following regular expressions equivalent?

Proving regular expression identity

Find automata for $S\to01X\mid0S,\;X\to2X\mid1Y,\;Y\to2Y2\mid0$

$\mathcal{L}_1 = \{\text{Strings with a 1 at a multiple of 3 from the front}\} $ and ...

Grammar for language not ending on "01"

How do I prove that this language is regular?

Trending Questions

Popular # Hahtags

Popular Questions