Question

Prove that $F = \{\,a^i b^j\mid i = kj \text{ for some positive integer }k\ \}$ is not context free

score 3.6k · Answer 1 · 2016-10-16 18:14:36

3.6k

Views

Prove that $F = \{\,a^i b^j\mid i = kj \text{ for some positive integer }k\ \}$ is not context free

Published on 16 Oct 2016 - 18:14

score 945 · Answer 2 · 2016-10-17 07:48:33

945

Views

Right quotient of $L_1=L(a^baa^)$, and $L_2=L(ab^*)$.

Published on 17 Oct 2016 - 7:48

score 3.1k · Answer 3 · 2016-10-18 13:32:49

3.1k

Views

Convert grammar to language (automata)

Published on 18 Oct 2016 - 13:32

score 1.1k · Answer 4 · 2016-10-19 04:14:59

1.1k

Views

Context Free Grammar Useless Productions

Published on 19 Oct 2016 - 4:14

score 299 · Answer 5 · 2016-10-22 23:15:41

299

Views

Operator precedence examples. Unary and binary.

Published on 22 Oct 2016 - 23:15

score 870 · Answer 6 · 2016-10-27 02:47:57

870

Views

Show that the following problem is decidable (involving CF Grammar)

Published on 27 Oct 2016 - 2:47

score 420 · Answer 7 · 2016-10-28 00:59:03

420

Views

Provide an unambiguous context-free grammar for a language $L$

Published on 28 Oct 2016 - 0:59

score 724 · Answer 8 · 2026-03-25 07:41:39

724

Views

Proving a language is not context-free (pumping lemma)

Published on 25 Mar 2026 - 7:41

score 174 · Answer 9 · 2016-10-28 15:30:47

174

Views

Context free grammar for the language {a^{i}b^{j}, j> 2i}

Published on 28 Oct 2016 - 15:30

score 4.2k · Answer 10 · 2016-10-28 16:33:21

4.2k

Views

Show that the CFG with productions S→ a | Sa | bSS | SSb | SbS is ambiguous?

Published on 28 Oct 2016 - 16:33

score 63 · Answer 11 · 2016-10-29 00:10:28

63

Views

Prove this language is not context-free

Published on 29 Oct 2016 - 0:10

score 484 · Answer 12 · 2026-03-25 11:12:20

484

Views

Convert this CFG to Chomsky normal form.

Published on 25 Mar 2026 - 11:12

score 30 · Answer 13 · 2026-03-25 07:44:05

30

Views

Is it possible to build a context-free grammar for the following language?

Published on 25 Mar 2026 - 7:44

score 78 · Answer 14 · 2016-11-17 16:02:28

78

Views

Grammar for $0^a1^b2^c3^d$ with $a+b = c+d$

Published on 17 Nov 2016 - 16:02

score 86 · Answer 15 · 2016-11-20 12:39:56

86

Views

How to prove that there is no algorithm to create context free grammar by the description

Published on 20 Nov 2016 - 12:39

List Question

Prove that $F = \{\,a^i b^j\mid i = kj \text{ for some positive integer }k\ \}$ is not context free

Right quotient of $L_1=L(a^baa^)$, and $L_2=L(ab^*)$.

Convert grammar to language (automata)

Context Free Grammar Useless Productions

Operator precedence examples. Unary and binary.

Show that the following problem is decidable (involving CF Grammar)

Provide an unambiguous context-free grammar for a language $L$

Proving a language is not context-free (pumping lemma)

Context free grammar for the language {a^{i}b^{j}, j> 2i}

Show that the CFG with productions S→ a | Sa | bSS | SSb | SbS is ambiguous?

Prove this language is not context-free

Convert this CFG to Chomsky normal form.

Is it possible to build a context-free grammar for the following language?

Grammar for $0^a1^b2^c3^d$ with $a+b = c+d$

How to prove that there is no algorithm to create context free grammar by the description

Trending Questions

Popular # Hahtags

Popular Questions