diff options
| author | Yuval Adam <yuv.adm@gmail.com> | 2012-05-18 11:34:02 +0300 |
|---|---|---|
| committer | Yuval Adam <yuv.adm@gmail.com> | 2012-05-18 11:34:02 +0300 |
| commit | c8342f6432bf5bf1e7732ae0265a80adfa5c9221 (patch) | |
| tree | b16846686867a87c8d745d98a139bbdb4609205f | |
| parent | a4db1bb5c3213fa4ef5645605b89429787f1b8f3 (diff) | |
typo
| -rw-r--r-- | README.md | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -19,7 +19,7 @@ Definition ------ An L-system is a formal grammar defined as an initial axiom string, and a set -of production rules. In te aforementioned example, `F` is the initial axiom, +of production rules. In the aforementioned example, `F` is the initial axiom, and only one production rule exists: `F -> F-F+FF`. The grammar alphabet is assumed to be all characters with a production rule mapping. |