List questions from formal-grammar

Published on 13 Oct 2015 - 20:09

1k

Views

Construct DFA from context-free grammar

Published on 01 Mar 2026 - 20:47

21

Views

Newbie Question formal languages N-1 for a language typ 3

Published on 24 Feb 2026 - 7:28

3.3k

Views

How to draw DPDA for language $L = \{a^ncb^{2n} | n \geq1\}$over the alphabet $\Sigma =\{a,b,c\} ?$

Published on 29 Oct 2015 - 12:01

20

Views

Are these two grammars similar?

Published on 31 Oct 2015 - 11:05

769

Views

Proving L(G) = L using induction and deriving a schema

Published on 09 Mar 2026 - 18:57

1.1k

Views

What is the language of following CFG?

Published on 26 Nov 2015 - 12:56

41

Views

How to write this sentence formally

Published on 27 Nov 2015 - 13:51

62

Views

Chomsky Normal Form Transformation

Published on 06 Dec 2015 - 18:45

63

Views

Prove that if you can derive w from α in n steps, it's possible with n left-derivations as well

Published on 30 Dec 2015 - 17:41

226

Views

Prove that two arithmetic grammars generate the same language

Published on 02 Jan 2016 - 13:43

75

Views

When can we do induction over the language defined by a formal grammar?

Published on 15 Jan 2016 - 23:39

248

Views

How can I check that the language of one context-free grammar is a subset of a second context-free grammar?

Published on 23 Feb 2026 - 2:50

680

Views

How to identify context free language?

Published on 15 Feb 2016 - 9:54

407

Views

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

Published on 21 Feb 2016 - 14:22

List Question

Construct a Grammar for a language that includes mod

Construct DFA from context-free grammar

Newbie Question formal languages N-1 for a language typ 3

How to draw DPDA for language $L = \{a^ncb^{2n} | n \geq1\}$over the alphabet $\Sigma =\{a,b,c\} ?$

Are these two grammars similar?

Proving L(G) = L using induction and deriving a schema

What is the language of following CFG?

How to write this sentence formally

Chomsky Normal Form Transformation

Prove that if you can derive w from α in n steps, it's possible with n left-derivations as well

Prove that two arithmetic grammars generate the same language

When can we do induction over the language defined by a formal grammar?

How can I check that the language of one context-free grammar is a subset of a second context-free grammar?

How to identify context free language?

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

Trending Questions

Popular # Hahtags

Popular Questions