Question

How is $\{uv \in \{0,1\}^* | \space|u|=|v| \text{ and } u\neq v \text{ at exactly 2 characters} \}$ not a CFL?

score 91 · Answer 1 · 2026-03-25 23:39:44

91

Views

How is $\{uv \in \{0,1\}^* | \space|u|=|v| \text{ and } u\neq v \text{ at exactly 2 characters} \}$ not a CFL?

Published on 25 Mar 2026 - 23:39

score 40 · Answer 2 · 2020-05-02 12:56:34

40

Views

What does "$u(i)$" mean in $\{uv^R\space|\space |u|=|v| \space \text{and } \forall i \space u(i) \neq v(i)\}$

Published on 02 May 2020 - 12:56

score 45 · Answer 3 · 2026-03-26 06:17:42

45

Views

Regular expression without subword 000

Published on 26 Mar 2026 - 6:17

score 38 · Answer 4 · 2020-05-05 19:31:19

38

Views

Find CFG for given formal language

Published on 05 May 2020 - 19:31

score 170 · Answer 5 · 2026-03-26 01:07:25

170

Views

If a language is Turing decidable, does that make the sublanguages also Turing decidable

Published on 26 Mar 2026 - 1:07

score 71 · Answer 6 · 2026-03-26 01:27:05

71

Views

Finding Context free grammar from a language

Published on 26 Mar 2026 - 1:27

score 363 · Answer 7 · 2026-03-25 23:38:04

363

Views

Constructing CFG for even length words with maximum of two 0's

Published on 25 Mar 2026 - 23:38

score 110 · Answer 8 · 2020-05-16 08:19:33

110

Views

Is the intersection of two "sausage" languages also a "sausage" language?

Published on 16 May 2020 - 8:19

score 29 · Answer 9 · 2026-03-26 01:17:59

29

Views

$\mathcal{G} = \{ v_2 v_4 \ldots v_{k} ~:~ v_1 v_2 v_3 v_4 \ldots v_{k-1} v_{k} \in \mathcal{L}, ~ \text{k even} \} $ is context free language

Published on 26 Mar 2026 - 1:17

score 232 · Answer 10 · 2020-05-23 09:09:43

232

Views

Mealy-Moore machine book recommendation

Published on 23 May 2020 - 9:09

score 774 · Answer 11 · 2020-05-27 22:19:21

774

Views

How to build a Finite Automata by combining two regular expressions?

Published on 27 May 2020 - 22:19

score 19 · Answer 12 · 2020-05-28 02:16:55

19

Views

Regular language and Finite Automata (FA).

Published on 28 May 2020 - 2:16

score 286 · Answer 13 · 2026-03-26 06:20:02

286

Views

Regular expression for languages with limit on repeated letters

Published on 26 Mar 2026 - 6:20

score 1.6k · Answer 14 · 2020-05-30 13:08:19

1.6k

Views

Show that pda with limited stack accepts regular languages

Published on 30 May 2020 - 13:08

score 428 · Answer 15 · 2026-03-25 23:35:39

428

Views

Convert grammar into Chomsky Normal Form

Published on 25 Mar 2026 - 23:35

List Question

How is $\{uv \in \{0,1\}^* | \space|u|=|v| \text{ and } u\neq v \text{ at exactly 2 characters} \}$ not a CFL?

What does "$u(i)$" mean in $\{uv^R\space|\space |u|=|v| \space \text{and } \forall i \space u(i) \neq v(i)\}$

Regular expression without subword 000

Find CFG for given formal language

If a language is Turing decidable, does that make the sublanguages also Turing decidable

Finding Context free grammar from a language

Constructing CFG for even length words with maximum of two 0's

Is the intersection of two "sausage" languages also a "sausage" language?

$\mathcal{G} = \{ v_2 v_4 \ldots v_{k} ~:~ v_1 v_2 v_3 v_4 \ldots v_{k-1} v_{k} \in \mathcal{L}, ~ \text{k even} \} $ is context free language

Mealy-Moore machine book recommendation

How to build a Finite Automata by combining two regular expressions?

Regular language and Finite Automata (FA).

Regular expression for languages with limit on repeated letters

Show that pda with limited stack accepts regular languages

Convert grammar into Chomsky Normal Form

Trending Questions

Popular # Hahtags

Popular Questions