Name
Abstract | ||
|---|---|---|
Recurrence systems have been devised to describe formally certain types of biological developments. A recurrence system specifies a formal language associated with the development of an organism. The family of languages defined by recurrence systems is an extension of some interesting families of languages, including the family of context-free languages. Some normal-form theorems are proved and the equivalence of the family of recurrence languages to a previously studied family of developmental languages (EOL-languages) is shown. Various families of developmental and other formal languages are characterized using recurrence systems. Some closure properties are also discussed. |
Year | DOI | Venue |
|---|---|---|
1975 | 10.1007/BF01780579 | Mathematical Systems Theory |
Keywords | Field | DocType |
Computational Mathematic,Biological Development,Formal Language,Interesting Family,Closure Property | Discrete mathematics,Formal language,Closure (mathematics),Abstract family of languages,Equivalence (measure theory),Cone (formal languages),Mathematics,Ontology language | Journal |
Volume | Issue | ISSN |
8 | 4 | 1433-0490 |
Citations | PageRank | References |
7 | 3.54 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gabor T. Herman | 1 | 1373 | 582.81 |
| Aristid Lindenmayer | 2 | 208 | 53.63 |
| Grzegorz Rozenberg | 3 | 5208 | 1039.94 |