Automata Theory

2 Context-free languages

Definition 2
#

Define the context-free grammar \(G_1\) as \(S \to \varepsilon | a S b\).

Theorem 3
#

\(\varepsilon \in L(G_1)\)

Proof

easy

Theorem 4
#

\(ab \in L(G_1)\)

Proof

easy