Name
Abstract | ||
|---|---|---|
Substitution systems, where strings are rewritten according to local rules, have many applications. They are used to model the development of plants, as well as to generate music and architectural designs. Many substitution systems can generate highly complex patterns using only simple rules. This feature can make substitution systems difficult to analyze mathematically. A different approach, pioneered by Stephen Wolfram, is to use computer searches to reveal simple systems with interesting properties. This approach is used to explore a class of systems we call symmetric sequential substitution systems within which a string is repeatedly updated by applying rewrite rules in a non-overlapping way. In this paper several simple examples of these systems are exhibited that produce complex behavior. The dynamics of several of these systems are studied and a system is exhibited that is computationally universal. Applications of symmetric sequential substitution systems are discussed, such as compression and the evaluation of numerical functions. |
Year | Venue | Field |
|---|---|---|
2013 | COMPLEX SYSTEMS | Theoretical computer science,Artificial intelligence,Mathematics,Machine learning |
DocType | Volume | Issue |
Journal | 22 | 1 |
ISSN | Citations | PageRank |
0891-2513 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Richard Southwell | 1 | 5 | 1.97 |
| Chris Cannings | 2 | 1 | 1.04 |