Question

Buna, am urmatoarea cerinta:


Sa se construiasca gramatici care generează limbajele:

a. L = {a^2n | n≥1}

b. L1 = {x^n * y^n | n≥1}

Answer 1

$a) \,\,\,L = \left\{a^{2n}\,|\,n\geq 1\right\}$

$S \Rightarrow aSa\\ S\Rightarrow aa$

$\\b)\,\,\,L = \left\{x^{n}y^n\,|\,n\geq 1\right\}$

$S\Rightarrow xSy\\ S\Rightarrow xy$