## Context-Free Languages

A context-free grammar is a tuple $$G=(V, \Sigma, P, S)$$ where $$V$$ is a finite set of variables, $$\Sigma$$ is an alphabet with a finite set of symbols which are called terminals, $$P$$ is a finite set of production rules,

Tagged with: , , ,
Posted in Theory