user avatar
user avatar
user avatar
hermi
  • Member for 1 year, 3 months
  • Last seen more than a month ago
1 vote
2 answers
149 views

Proving that the language $\{ w^n\mid w \in \{0,1\}^∗, \, n \ge 2 \}$ is not regular

1 vote
2 answers
86 views

Proving that $X\to aX|Y$, $Y \to Yab|b$ is unambiguous

1 vote
1 answer
83 views

eliminate left recursion of below grammar

1 vote
1 answer
108 views

Proving $\{ a^n b^m \mid n \leq m^2 \}$ is not context-free using pumping lemma

1 vote
1 answer
49 views

Decidability of $\{⟨G⟩ \mid \text{$G$ is CFG and $L(G) ⊈ \Sigma^+$}\}$

0 votes
2 answers
107 views

prove language is decidable

0 votes
1 answer
89 views

Constructing PDA to accept language $L=\{a^i b^j c^k \mid k\geq \min(i,j)\}$

0 votes
1 answer
49 views

PDA accepting of a specific symmetric language

0 votes
1 answer
39 views

Grammar for $\{ a^i b^j: j < 2i \text{ and } j \ne i \} $

0 votes
1 answer
69 views

Is the language $\{a^n b^m \mid 2n + 3m \le 1000 \}$ regular?

0 votes
1 answer
77 views

Is the language $\{a^n b^m : 1000|nm \}$ regular?

-1 votes
1 answer
25 views

Grammar for $\{ (n_a(w) - n_b(w)) mod\ 3 = 2 \} $