Question

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

score 391 · Answer 1 · 2018-04-19 11:58:17

391

Views

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

Published on 19 Apr 2018 - 11:58

score 50 · Answer 2 · 2026-03-22 00:14:34

50

Views

Context-Free Grammar / Automata

Published on 22 Mar 2026 - 0:14

score 969 · Answer 3 · 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 71 · Answer 4 · 2026-03-22 15:18:19

71

Views

Language that is CFL by Odgen but not by pumping lemma

Published on 22 Mar 2026 - 15:18

score 163 · Answer 5 · 2018-05-26 11:56:22

163

Views

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

Published on 26 May 2018 - 11:56

score 39 · Answer 6 · 2018-05-30 17:06:37

39

Views

Algorithm for converting grammar to Chomsky normal form application

Published on 30 May 2018 - 17:06

score 103 · Answer 7 · 2018-06-05 12:49:49

103

Views

Context-Free Grammar to Pushdown (Stack) Automata

Published on 05 Jun 2018 - 12:49

score 223 · Answer 8 · 2018-06-06 12:18:37

223

Views

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

Published on 06 Jun 2018 - 12:18

score 37 · Answer 9 · 2026-03-22 03:57:56

37

Views

Finding a CFG for this Language

Published on 22 Mar 2026 - 3:57

score 1.7k · Answer 10 · 2018-06-09 09:09:52

1.7k

Views

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

Published on 09 Jun 2018 - 9:09

score 238 · Answer 11 · 2018-06-12 10:48:02

238

Views

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

Published on 12 Jun 2018 - 10:48

score 35 · Answer 12 · 2026-03-23 08:44:22

35

Views

What grammar domain is this kind of grammar?

Published on 23 Mar 2026 - 8:44

score 2.4k · Answer 13 · 2018-06-21 11:26:32

2.4k

Views

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

Published on 21 Jun 2018 - 11:26

score 79 · Answer 14 · 2018-06-23 09:13:42

79

Views

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

Published on 23 Jun 2018 - 9:13

score 253 · Answer 15 · 2026-02-22 23:39:07

253

Views

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

Published on 22 Feb 2026 - 23:39

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