Paper Info
Title
Developmental systems with locally catenative formulas
Abstract
A locally catenative sequence of strings of letters is such that each string in the sequence, after an initial stretch, is formed by concatenating strings which occurred at some specified distances previously in the sequence. These kinds of structures are frequently encountered in biological development, particularly in the case of compound branching structures or compound leaves. Developmental systems have been formally defined in previous publications. One of the present results is that dependent PDOL systems can produce sequences for every locally catenative formula (PDOL systems are propagating, deterministic developmental systems without interactions). Every dependent PDOL system produces a sequence which satisfies an infinite class of locally catenative formulas. Some of these formulas can be derived from a minimum formula, but a sequence may satisfy more than one minimum formulas.
Year
DOI
Venue
1973
10.1007/BF00289079
Acta Inf.
Keywords
Field
DocType
Information System,Operating System,Data Structure,Communication Network,Information Theory
Information theory,Information system,Discrete mathematics,Data structure,Combinatorics,Telecommunications network,Concatenation,Mathematics,Branching (version control)
Journal
Volume
Issue
Citations 
2
3
24
PageRank 
References 
Authors
12.29
4
2
Name
Order
Citations
PageRank
Grzegorz Rozenberg152081039.94
Aristid Lindenmayer220853.63