Question

If RE languages are closed under intersection, why aren't CFLs?

score 394 · Answer 1 · 2026-04-14 12:59:15

394

Views

If RE languages are closed under intersection, why aren't CFLs?

Published on 14 Apr 2026 - 12:59

score 54 · Answer 2 · 2026-04-12 21:42:12

54

Views

Context-Free Grammar / Automata

Published on 12 Apr 2026 - 21:42

score 970 · Answer 3 · 2026-04-09 02:21:49

970

Views

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

Published on 09 Apr 2026 - 2:21

score 75 · Answer 4 · 2026-04-23 22:17:22

75

Views

Language that is CFL by Odgen but not by pumping lemma

Published on 23 Apr 2026 - 22:17

score 165 · Answer 5 · 2026-04-15 08:49:18

165

Views

Proving $L'=\{uv:u\in L \; \land v \in L^R \; \land |u|=|v|\}$ is a CFL with closure properties

Published on 15 Apr 2026 - 8:49

score 42 · Answer 6 · 2026-04-13 16:45:36

42

Views

Algorithm for converting grammar to Chomsky normal form application

Published on 13 Apr 2026 - 16:45

score 106 · Answer 7 · 2026-04-12 20:27:57

106

Views

Context-Free Grammar to Pushdown (Stack) Automata

Published on 12 Apr 2026 - 20:27

score 226 · Answer 8 · 2026-04-13 21:31:27

226

Views

Is $\{a^n b^n c^{2n} \mid n \geqslant 0\}$ a context-free language?

Published on 13 Apr 2026 - 21:31

score 41 · Answer 9 · 2026-04-09 03:09:05

41

Views

Finding a CFG for this Language

Published on 09 Apr 2026 - 3:09

score 1.7k · Answer 10 · 2026-04-13 01:46:26

1.7k

Views

how to determine if a context free language is deterministic or nondeterministic in general

Published on 13 Apr 2026 - 1:46

score 241 · Answer 11 · 2026-04-10 17:08:53

241

Views

Subset of Context Free Language with Strings Starting and Ending in Same Symbol is Context Free

Published on 10 Apr 2026 - 17:08

score 40 · Answer 12 · 2026-04-29 12:50:56

40

Views

What grammar domain is this kind of grammar?

Published on 29 Apr 2026 - 12:50

score 2.4k · Answer 13 · 2026-04-14 05:23:50

2.4k

Views

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

Published on 14 Apr 2026 - 5:23

score 81 · Answer 14 · 2026-04-14 07:50:11

81

Views

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

Published on 14 Apr 2026 - 7:50

score 256 · Answer 15 · 2026-04-11 16:12:08

256

Views

Is any context-free grammar in Chomsky form with at most 2017 rules necessarily finite?

Published on 11 Apr 2026 - 16:12

List Question

If RE languages are closed under intersection, why aren't CFLs?

Context-Free Grammar / Automata

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

Language that is CFL by Odgen but not by pumping lemma

Proving $L'=\{uv:u\in L \; \land v \in L^R \; \land |u|=|v|\}$ is a CFL with closure properties

Algorithm for converting grammar to Chomsky normal form application

Context-Free Grammar to Pushdown (Stack) Automata

Is $\{a^n b^n c^{2n} \mid n \geqslant 0\}$ a context-free language?

Finding a CFG for this Language

how to determine if a context free language is deterministic or nondeterministic in general

Subset of Context Free Language with Strings Starting and Ending in Same Symbol is Context Free

What grammar domain is this kind of grammar?

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

Is any context-free grammar in Chomsky form with at most 2017 rules necessarily finite?

Trending Questions

Popular # Hahtags

Popular Questions