Need a grammar that can create this language, I am having issues getting a language to work and was looking for help.
1
-
$\begingroup$ Hello there 👋, are the $n$s and the $2n$ supposed to be exponents? As in $L = \{a^nb^na^{2n} : n \geq 1\}$? $\endgroup$– KnoggerCommented Mar 18 at 0:55
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
This is probably not the simplest, but here's a grammar for $L = \{a^nb^na^{2n} : n \geq 1\}$. Let $G = (\{S, A, B\}, \{a, b\}, P, S)$ where $P$ contains exactly
$$S \to aAbaa$$ $$A \to aAbBB | \varepsilon$$ $$Bb \to bB$$ $$Ba \to aa$$
then $L(G) = L$.
