Question

How can I determine the language from a DFA?

score 115 · Answer 1 · 2023-05-03 15:35:13

115

Views

How can I determine the language from a DFA?

Published on 03 May 2023 - 15:35

score 38 · Answer 2 · 2026-03-25 10:54:15

38

Views

Using CFL pumping lemma to show that a language is not context free

Published on 25 Mar 2026 - 10:54

score 90 · Answer 3 · 2026-03-22 15:34:10

90

Views

Is the following language is regular, context free, and/or decidable?

Published on 22 Mar 2026 - 15:34

score 40 · Answer 4 · 2023-05-23 19:38:23

40

Views

Creating "Zigzag" context-free grammar of $2$ languages with the same letters

Published on 23 May 2023 - 19:38

score 61 · Answer 5 · 2023-06-18 06:48:47

61

Views

How do I prove that $L = \{a^{i}b^{j}a^{k} | i ≠ j, j ≠ k, k ≠ i ; i, j,k > 0\}$ is not context free?

Published on 18 Jun 2023 - 6:48

score 33 · Answer 6 · 2026-03-25 12:55:01

33

Views

an unclear definition about the types of phrase-structure grammars

Published on 25 Mar 2026 - 12:55

score 45 · Answer 7 · 2026-03-25 12:46:11

45

Views

regex for exactly n possible values which are unique

Published on 25 Mar 2026 - 12:46

score 48 · Answer 8 · 2026-03-25 12:49:59

48

Views

Suppose we have unambiguous context-free language, how can we calculate the number of words that can be represented by $n$ terminals?

Published on 25 Mar 2026 - 12:49

score 66 · Answer 9 · 2026-03-25 12:50:50

66

Views

CFG for $L = \{w_1w_2 \cdots w_{2n} \mid n > 0, w_i \in \{a, b\}, 1 \leq i \leq 2n, w_j = b, w_{n + j} = a \ \exists j, 1 \leq j \leq n\}$

Published on 25 Mar 2026 - 12:50

score 46 · Answer 10 · 2023-10-13 01:22:50

46

Views

I am not sure some notations' usage in the formal language and context free grammar

Published on 13 Oct 2023 - 1:22

score 186 · Answer 11 · 2023-11-06 10:19:11

186

Views

Is $M(L)=\left\{w \in L \mid \forall v \in \Sigma^+,vw \notin L\right\}$context-free?

Published on 06 Nov 2023 - 10:19

score 56 · Answer 12 · 2023-11-15 06:59:53

56

Views

Concatenation of languages - Basics

Published on 15 Nov 2023 - 6:59

score 64 · Answer 13 · 2023-11-23 06:47:05

How to show that the language $L = \{a^n , n \geq 10000 \text{ and $n$ is prime number}\}$ is not context-free using closure property?

score 280 · Answer 14 · 2026-03-25 10:52:49

280

Views

Proving that a language whose strings have prime length is not context-free

Published on 25 Mar 2026 - 10:52

score 19 · Answer 15 · 2023-11-30 17:02:39

19

Views

superstring(L) = {$xyz$ | $y ∈$ L and $x, z ∈ Σ*$} is a context-free language?

Published on 30 Nov 2023 - 17:02

List Question

How can I determine the language from a DFA?

Using CFL pumping lemma to show that a language is not context free

Is the following language is regular, context free, and/or decidable?

Creating "Zigzag" context-free grammar of $2$ languages with the same letters

How do I prove that $L = \{a^{i}b^{j}a^{k} | i ≠ j, j ≠ k, k ≠ i ; i, j,k > 0\}$ is not context free?

an unclear definition about the types of phrase-structure grammars

regex for exactly n possible values which are unique

Suppose we have unambiguous context-free language, how can we calculate the number of words that can be represented by $n$ terminals?

CFG for $L = \{w_1w_2 \cdots w_{2n} \mid n > 0, w_i \in \{a, b\}, 1 \leq i \leq 2n, w_j = b, w_{n + j} = a \ \exists j, 1 \leq j \leq n\}$

I am not sure some notations' usage in the formal language and context free grammar

Is $M(L)=\left\{w \in L \mid \forall v \in \Sigma^+,vw \notin L\right\}$context-free?

Concatenation of languages - Basics

How to show that the language $L = \{a^n , n \geq 10000 \text{ and $n$ is prime number}\}$ is not context-free using closure property?

Proving that a language whose strings have prime length is not context-free

superstring(L) = {$xyz$ | $y ∈$ L and $x, z ∈ Σ*$} is a context-free language?

Trending Questions

Popular # Hahtags

Popular Questions