Question

Prove that L = $ \{wuv \mid w + u = v\}$ is not context free where w, u, v is interpreted as ordinary integers.

score 71 · Answer 1 · 2026-05-10 17:17:54

71

Views

Prove that L = $ \{wuv \mid w + u = v\}$ is not context free where w, u, v is interpreted as ordinary integers.

Published on 10 May 2026 - 17:17

score 470 · Answer 2 · 2026-04-11 04:14:44

470

Views

Does there exist a universal finite automaton?

Published on 11 Apr 2026 - 4:14

score 157 · Answer 3 · 2026-04-15 02:05:13

A language L over an alphabet Σ such that for all homomorphisms h : Σ* → Σ* there exists a string x ∈ L for which |h(x)| ≤ |x|?

score 195 · Answer 4 · 2026-04-30 15:36:55

195

Views

Complement of a language

Published on 30 Apr 2026 - 15:36

score 58 · Answer 5 · 2026-04-17 03:07:49

Two languages such that $L_1 \cup L_2 \leq_m\, L_1 \cap L_2$ and two (other?) such that $L_1 \cap L_2 ≤_m\, L_1 \cup L_2$?

score 105 · Answer 6 · 2026-05-11 06:12:10

105

Views

why is this language regular?(complicated)

Published on 11 May 2026 - 6:12

score 74 · Answer 7 · 2026-05-11 08:38:23

74

Views

Is L is the empty set, {$\emptyset$}, is it then true that LL = {$xx \mid x\in L$}?

Published on 11 May 2026 - 8:38

score 37 · Answer 8 · 2026-04-17 09:05:09

37

Views

Generate a Pushdown Automaton that accepts the strings from the language $L=\{a^ib^jc^k, i + k \ne j\}$

Published on 17 Apr 2026 - 9:05

score 233 · Answer 9 · 2026-05-11 08:01:59

233

Views

I am having trouble understanding if my production rules are context-free grammar or not

Published on 11 May 2026 - 8:01

score 399 · Answer 10 · 2026-05-11 03:17:08

399

Views

Is the language over the alphabet {0,1,2} consisting of equal number of substrings "01" and "10" context-free?

Published on 11 May 2026 - 3:17

score 212 · Answer 11 · 2026-04-13 23:50:31

212

Views

DFA for odd a's and even a's?? When to accept empty string??

Published on 13 Apr 2026 - 23:50

score 3.7k · Answer 12 · 2026-05-11 03:10:25

3.7k

Views

Find a CFG for even string and at least one 1's in the left part

Published on 11 May 2026 - 3:10

score 43 · Answer 13 · 2026-05-10 17:19:55

43

Views

Find a CFG for $0^n|v| where |v| = n$

Published on 10 May 2026 - 17:19

score 3k · Answer 14 · 2026-05-10 12:53:37

3k

Views

CFG for $a^ib^jc^k : j <= i + k$

Published on 10 May 2026 - 12:53

score 51 · Answer 15 · 2026-05-10 17:18:37

51

Views

What this automaton about

Published on 10 May 2026 - 17:18

List Question

Prove that L = $ \{wuv \mid w + u = v\}$ is not context free where w, u, v is interpreted as ordinary integers.

Does there exist a universal finite automaton?

A language L over an alphabet Σ such that for all homomorphisms h : Σ* → Σ* there exists a string x ∈ L for which |h(x)| ≤ |x|?

Complement of a language

Two languages such that $L_1 \cup L_2 \leq_m\, L_1 \cap L_2$ and two (other?) such that $L_1 \cap L_2 ≤_m\, L_1 \cup L_2$?

why is this language regular?(complicated)

Is L is the empty set, {$\emptyset$}, is it then true that LL = {$xx \mid x\in L$}?

Generate a Pushdown Automaton that accepts the strings from the language $L=\{a^ib^jc^k, i + k \ne j\}$

I am having trouble understanding if my production rules are context-free grammar or not

Is the language over the alphabet {0,1,2} consisting of equal number of substrings "01" and "10" context-free?

DFA for odd a's and even a's?? When to accept empty string??

Find a CFG for even string and at least one 1's in the left part

Find a CFG for $0^n|v| where |v| = n$

CFG for $a^ib^jc^k : j <= i + k$

What this automaton about

Trending Questions

Popular # Hahtags

Popular Questions