List questions from context-free-grammar

Published on 25 Mar 2026 - 16:20

2.2k

Views

Stronger Pumping Lemma for Context Free Languages

Published on 25 Mar 2026 - 13:59

408

Views

Which grammar generates the language: $L = \{a^i b^j d^k | i, j, k ≥ 0 ∧ j < k\}$

Published on 25 Mar 2026 - 16:13

398

Views

Regular grammar with parity

Published on 26 Mar 2026 - 9:41

44

Views

What is flaw on my proof to identify any string of $L_2$ using single stack?

Published on 25 Mar 2026 - 17:37

84

Views

Create a formula for order of parenthesis

Published on 23 Feb 2026 - 2:46

1.4k

Views

Regular grammar that generates a set of strings with an odd number of occurrences of a substring

Published on 04 Mar 2016 - 20:22

76

Views

How to describe this Context Free Grammar?

Published on 11 Mar 2016 - 4:52

1.7k

Views

How to check if a language is regular

Published on 14 Mar 2016 - 12:51

2.5k

Views

Using Pumping Lemma to prove a language not regular

Published on 25 Mar 2026 - 19:01

1.8k

Views

Ambiguous grammar $S\to ABA$, $A\to aA|\varepsilon$, $B\to bB|\varepsilon$

Published on 15 Mar 2016 - 19:19

61

Views

Context-free language

Published on 16 Mar 2016 - 22:07

87

Views

Existence of context-free grammar over {0,1} alphabet

Published on 16 Mar 2016 - 22:39

34

Views

Context free grammar over { a^n * b^(n+3) | n >= 0 }

Published on 24 Mar 2016 - 17:00

153

Views

Proving that everything in a language can be generated by a grammar

Published on 29 Mar 2016 - 6:09

List Question

How to identify context free language?

Stronger Pumping Lemma for Context Free Languages

Which grammar generates the language: $L = \{a^i b^j d^k | i, j, k ≥ 0 ∧ j < k\}$

Regular grammar with parity

What is flaw on my proof to identify any string of $L_2$ using single stack?

Create a formula for order of parenthesis

Regular grammar that generates a set of strings with an odd number of occurrences of a substring

How to describe this Context Free Grammar?

How to check if a language is regular

Using Pumping Lemma to prove a language not regular

Ambiguous grammar $S\to ABA$, $A\to aA|\varepsilon$, $B\to bB|\varepsilon$

Context-free language

Existence of context-free grammar over {0,1} alphabet

Context free grammar over { a^n * b^(n+3) | n >= 0 }

Proving that everything in a language can be generated by a grammar

Trending Questions

Popular # Hahtags

Popular Questions