Automata and Grammars
Print this page
First   |   Last   |   Prev   |   Next
Formaly, for a given grammar the language generated by G is

That is iff .

If , we must have for some , , denoted as a derivation sequence of w, The strings are denoted as sentential forms of the derivation.

First   |   Last   |   Prev   |   Next