List questions from context-free-grammar

Published on 25 Mar 2013 - 4:29

2.2k

Views

Push down automata problem

Published on 25 Mar 2013 - 6:58

495

Views

Describe a PDA that accepts all strings over $\{a, b\}$ that have as many $a$’s as $b$’s.

Published on 25 Mar 2013 - 11:44

116

Views

Proving non CFL with pumping lemma

Published on 26 Mar 2013 - 3:45

810

Views

Context free grammar construction

Published on 31 Mar 2013 - 0:19

98

Views

pumping lemma for context free languages

Published on 25 Mar 2026 - 17:23

1.1k

Views

Context free grammar for palindrome over ALL terminals?

Published on 25 Mar 2026 - 23:37

51

Views

Left factor a grammar that doesn't have a left common factor?

Published on 02 Oct 2020 - 12:24

68

Views

How can I use the pumping lemma for context-free language in a language with two alphabets?

Published on 25 Mar 2026 - 17:26

25

Views

Form of strings in $\{a^nb^n | n \geq 0 \}^$ vis-a-vis $(a^nb^n)^$

Published on 02 Oct 2020 - 23:02

3.2k

Views

Regular expression for language over $\{a, b\}$ with equal number of $a$ and $b$, any prefix has at most one more $a$ than $b$ or $b$ than $a$?

Published on 28 Mar 2026 - 5:23

175

Views

Giving example for context-free grammar

Published on 13 Oct 2020 - 20:47

339

Views

Convert Context Free Grammar to pushdown automata

Published on 22 Mar 2026 - 11:13

143

Views

Give a PDA for the following language

Published on 14 Oct 2020 - 12:14

359

Views

Pumping Lemma: context free squared number proof

Published on 25 Mar 2026 - 17:26

List Question

Context free language problem

Push down automata problem

Describe a PDA that accepts all strings over $\{a, b\}$ that have as many $a$’s as $b$’s.

Proving non CFL with pumping lemma

Context free grammar construction

pumping lemma for context free languages

Context free grammar for palindrome over ALL terminals?

Left factor a grammar that doesn't have a left common factor?

How can I use the pumping lemma for context-free language in a language with two alphabets?

Form of strings in $\{a^nb^n | n \geq 0 \}^$ vis-a-vis $(a^nb^n)^$

Regular expression for language over $\{a, b\}$ with equal number of $a$ and $b$, any prefix has at most one more $a$ than $b$ or $b$ than $a$?

Giving example for context-free grammar

Convert Context Free Grammar to pushdown automata

Give a PDA for the following language

Pumping Lemma: context free squared number proof

Trending Questions

Popular # Hahtags

Popular Questions