Question

What is the difference between pumping Lemma for regualar languages and pumping lemma for context free languages?

score 377 · Answer 1 · 2026-03-25 04:40:41

377

Views

What is the difference between pumping Lemma for regualar languages and pumping lemma for context free languages?

Published on 25 Mar 2026 - 4:40

score 33 · Answer 2 · 2020-03-28 19:44:36

33

Views

Using induction to show that the languages $\mathcal L(A)$ and $\mathcal L(G(A))$ are the same

Published on 28 Mar 2020 - 19:44

score 49 · Answer 3 · 2020-04-01 14:29:44

49

Views

Which symbols in the following grammar $G$ are generating?

Published on 01 Apr 2020 - 14:29

score 16 · Answer 4 · 2026-03-10 17:45:19

16

Views

The problem of determining whether a given context-free grammar generates the empty string

Published on 10 Mar 2026 - 17:45

score 22 · Answer 5 · 2020-04-05 14:10:40

22

Views

Which of these strings does the included pushdown automaton recognize based on accepting states?

Published on 05 Apr 2020 - 14:10

score 799 · Answer 6 · 2020-04-07 17:41:08

799

Views

Context-free grammars a(baba)

Published on 07 Apr 2020 - 17:41

score 92 · Answer 7 · 2020-04-08 09:23:38

92

Views

Keeping track of two different counters with a single stack, needed in recognizing the language $\mathcal L = \{0^m1^n \mid m \leq n \leq 2m\}$

Published on 08 Apr 2020 - 9:23

score 82 · Answer 8 · 2020-04-09 12:38:19

82

Views

Is $\mathcal L_1 \cup \mathcal L_2$ a DCFL, if and only if $\mathcal L_1 \cap \mathcal L_2$ is a DCFL?

Published on 09 Apr 2020 - 12:38

score 53 · Answer 9 · 2020-04-09 14:36:35

53

Views

Determining the lookahead set of an $\mathrm{LL}(1)$-grammar

Published on 09 Apr 2020 - 14:36

score 73 · Answer 10 · 2020-04-15 00:19:28

73

Views

Context free grammar of $L = \{w \in \{a, b, c\}^* : |w|_{c} = 3k +1 \}$

Published on 15 Apr 2020 - 0:19

score 48 · Answer 11 · 2020-04-23 18:59:17

48

Views

Is the language $=\{^.^.^j.^i:,≥0\}$ context free language?

Published on 23 Apr 2020 - 18:59

score 4.4k · Answer 12 · 2020-04-24 16:00:51

4.4k

Views

context free grammar that generates binary all numbers divisible by 3

Published on 24 Apr 2020 - 16:00

score 90 · Answer 13 · 2020-05-01 13:11:05

90

Views

How is $\{uv \in \{0,1\}^* | \space|u|=|v| \text{ and } u\neq v \text{ at exactly 2 characters} \}$ not a CFL?

Published on 01 May 2020 - 13:11

score 46 · Answer 14 · 2020-05-05 23:59:00

46

Views

formal languages write context-free grammar

Published on 05 May 2020 - 23:59

score 169 · Answer 15 · 2020-05-06 13:45:53

169

Views

If a language is Turing decidable, does that make the sublanguages also Turing decidable

Published on 06 May 2020 - 13:45

List Question

What is the difference between pumping Lemma for regualar languages and pumping lemma for context free languages?

Using induction to show that the languages $\mathcal L(A)$ and $\mathcal L(G(A))$ are the same

Which symbols in the following grammar $G$ are generating?

The problem of determining whether a given context-free grammar generates the empty string

Which of these strings does the included pushdown automaton recognize based on accepting states?

Context-free grammars a(baba)

Keeping track of two different counters with a single stack, needed in recognizing the language $\mathcal L = \{0^m1^n \mid m \leq n \leq 2m\}$

Is $\mathcal L_1 \cup \mathcal L_2$ a DCFL, if and only if $\mathcal L_1 \cap \mathcal L_2$ is a DCFL?

Determining the lookahead set of an $\mathrm{LL}(1)$-grammar

Context free grammar of $L = \{w \in \{a, b, c\}^* : |w|_{c} = 3k +1 \}$

Is the language $=\{^.^.^j.^i:,≥0\}$ context free language?

context free grammar that generates binary all numbers divisible by 3

How is $\{uv \in \{0,1\}^* | \space|u|=|v| \text{ and } u\neq v \text{ at exactly 2 characters} \}$ not a CFL?

formal languages write context-free grammar

If a language is Turing decidable, does that make the sublanguages also Turing decidable

Trending Questions

Popular # Hahtags

Popular Questions