| Automata and Grammars | ||
| Example: Find a grammar for the language It is possible to find a grammar for L by modifying the previous grammar since we need to generate an extra b at the end of the string Using the above concept we devise the follwoing grammar for L.
N = { S, B } P = { S |
||