Question

Proving that $L=\{xww^r\mid x,w \in \{0,1\}^+\}$ is not regular

score 289 · Answer 1 · 2026-03-22 16:09:14

289

Views

Proving that $L=\{xww^r\mid x,w \in \{0,1\}^+\}$ is not regular

Published on 22 Mar 2026 - 16:09

score 60 · Answer 2 · 2026-03-25 02:57:23

60

Views

Generalizing Regular Expression from FAs

Published on 25 Mar 2026 - 2:57

score 2.9k · Answer 3 · 2026-02-22 23:36:15

2.9k

Views

Prove that every infinite regular language has an undecidable infinite subset

Published on 22 Feb 2026 - 23:36

score 359 · Answer 4 · 2026-03-25 04:36:56

359

Views

Design DFA for $ (a + b(ba)^)^b$

Published on 25 Mar 2026 - 4:36

score 289 · Answer 5 · 2026-03-25 03:07:40

289

Views

What is wrong with my application of the Myhill-Nerode theorem on this language?

Published on 25 Mar 2026 - 3:07

score 55 · Answer 6 · 2026-03-22 17:29:57

55

Views

$A= \{w \in \{a, b\}^∗ \mid \text{length of $a \leqslant 5$ and length of $b \leqslant 20$}\}$

Published on 22 Mar 2026 - 17:29

score 180 · Answer 7 · 2026-03-25 01:17:07

180

Views

i really don't know how to get $s = xyz$ for pumping lemma for this language

Published on 25 Mar 2026 - 1:17

score 1.2k · Answer 8 · 2026-03-25 04:39:01

1.2k

Views

Why is this language not Regular - w^Rw (i.e. a word concat. with its reverse)?

Published on 25 Mar 2026 - 4:39

score 969 · Answer 9 · 2026-02-22 23:35:11

969

Views

Is it semi-decidable whether a context-free grammar generates a regular language?

Published on 22 Feb 2026 - 23:35

score 1k · Answer 10 · 2026-03-25 03:02:29

1k

Views

Prove $(a+ba)^ba = (a^ba)^+$ and $(a+b(ab)^aa)^ b(ab)^a = (a^ba)^+$

Published on 25 Mar 2026 - 3:02

score 46 · Answer 11 · 2026-03-25 06:01:36

46

Views

How to prove that a language which clones is regular?

Published on 25 Mar 2026 - 6:01

score 2.4k · Answer 12 · 2026-03-24 23:45:04

2.4k

Views

Prove that language that has unequal 0's and 1's is not regular

Published on 24 Mar 2026 - 23:45

score 80 · Answer 13 · 2026-03-24 23:46:14

80

Views

Prove $L$ is context free if $L_1$, $L_2$, $L_3$ are regular by building a suitable grammar

Published on 24 Mar 2026 - 23:46

score 1.2k · Answer 14 · 2026-03-25 03:03:58

1.2k

Views

What is regular expression and its NFA of a word that accept any number that is divisible by 5?

Published on 25 Mar 2026 - 3:03

score 462 · Answer 15 · 2026-03-25 02:56:44

462

Views

Regular expression: Difference between $\emptyset$-concate and $\lambda$-concate?

Published on 25 Mar 2026 - 2:56

List Question

Proving that $L=\{xww^r\mid x,w \in \{0,1\}^+\}$ is not regular

Generalizing Regular Expression from FAs

Prove that every infinite regular language has an undecidable infinite subset

Design DFA for $ (a + b(ba)^)^b$

What is wrong with my application of the Myhill-Nerode theorem on this language?

$A= \{w \in \{a, b\}^∗ \mid \text{length of $a \leqslant 5$ and length of $b \leqslant 20$}\}$

i really don't know how to get $s = xyz$ for pumping lemma for this language

Why is this language not Regular - w^Rw (i.e. a word concat. with its reverse)?

Is it semi-decidable whether a context-free grammar generates a regular language?

Prove $(a+ba)^ba = (a^ba)^+$ and $(a+b(ab)^aa)^ b(ab)^a = (a^ba)^+$

How to prove that a language which clones is regular?

Prove that language that has unequal 0's and 1's is not regular

Prove $L$ is context free if $L_1$, $L_2$, $L_3$ are regular by building a suitable grammar

What is regular expression and its NFA of a word that accept any number that is divisible by 5?

Regular expression: Difference between $\emptyset$-concate and $\lambda$-concate?

Trending Questions

Popular # Hahtags

Popular Questions