Question

Constructing context free grammar with a number constraint to one of the elements in the language

score 119 · Answer 1 · 2026-03-21 19:18:03

119

Views

Constructing context free grammar with a number constraint to one of the elements in the language

Published on 21 Mar 2026 - 19:18

score 2.2k · Answer 2 · 2026-03-20 16:01:57

2.2k

Views

Converting CFG to a regular expression

Published on 20 Mar 2026 - 16:01

score 1.9k · Answer 3 · 2026-03-24 12:39:55

1.9k

Views

Is First Order Logic Syntax Context Free?

Published on 24 Mar 2026 - 12:39

score 175 · Answer 4 · 2026-03-22 19:36:16

175

Views

Can first-order logic be recognized by a pushdown automaton?

Published on 22 Mar 2026 - 19:36

score 3.4k · Answer 5 · 2026-03-22 17:59:51

3.4k

Views

Build a Context-Free Grammar for a given language

Published on 22 Mar 2026 - 17:59

score 5.7k · Answer 6 · 2026-03-23 06:07:55

5.7k

Views

Regular expression: At least two a's and doesn't end in bb

Published on 23 Mar 2026 - 6:07

score 681 · Answer 7 · 2026-03-22 03:05:16

681

Views

Context Free Grammar for a 3-variable language

Published on 22 Mar 2026 - 3:05

score 77 · Answer 8 · 2026-03-20 02:48:42

77

Views

Given language, say if it is regular, context-free and proove it.

Published on 20 Mar 2026 - 2:48

score 3k · Answer 9 · 2026-03-23 07:01:21

3k

Views

How to calculate the minimum pumping length for some L?

Published on 23 Mar 2026 - 7:01

score 720 · Answer 10 · 2026-03-23 02:37:33

720

Views

Significance of reflexive and transitive closure in String, Language & CFG

Published on 23 Mar 2026 - 2:37

score 425 · Answer 11 · 2026-03-22 17:10:58

425

Views

Chomsky–Schützenberger representation theorem in terms of groups

Published on 22 Mar 2026 - 17:10

score 72 · Answer 12 · 2026-03-23 03:37:47

72

Views

CFG for L = { (+,-)* | #(-) - #(+) ≤ 3 at every position of the word }

Published on 23 Mar 2026 - 3:37

score 180 · Answer 13 · 2026-03-22 23:03:54

180

Views

$L = \{ a^jb^mc^m : 0 \le j \le m \}$ prove that it is context free.

Published on 22 Mar 2026 - 23:03

score 1.1k · Answer 14 · 2026-03-23 14:19:15

1.1k

Views

What is the CFG for an arithmetic expression with possible matching nested parentheses?

Published on 23 Mar 2026 - 14:19

score 294 · Answer 15 · 2026-03-22 23:41:21

294

Views

What is the Chomsky class of a language containing strings of a prime length?

Published on 22 Mar 2026 - 23:41

List Question

Constructing context free grammar with a number constraint to one of the elements in the language

Converting CFG to a regular expression

Is First Order Logic Syntax Context Free?

Can first-order logic be recognized by a pushdown automaton?

Build a Context-Free Grammar for a given language

Regular expression: At least two a's and doesn't end in bb

Context Free Grammar for a 3-variable language

Given language, say if it is regular, context-free and proove it.

How to calculate the minimum pumping length for some L?

Significance of reflexive and transitive closure in String, Language & CFG

Chomsky–Schützenberger representation theorem in terms of groups

CFG for L = { (+,-)* | #(-) - #(+) ≤ 3 at every position of the word }

$L = \{ a^jb^mc^m : 0 \le j \le m \}$ prove that it is context free.

What is the CFG for an arithmetic expression with possible matching nested parentheses?

What is the Chomsky class of a language containing strings of a prime length?

Trending Questions

Popular # Hahtags

Popular Questions