Translator Between String Substitution Systems and Wolfram Model

[chandragan22]

The Problem

There are many different patterns possible in graph evolution, but the similarities between string substitution systems and Wolfram Model systems have not been explored fully.

Possible solution

I would like to create functions that would convert string substitution systems to a wolfram model system that would result in the same graph and vice versa. A simple method would be to have each letter correspond to a number. We can have two functions, possibly ToWolframModel and ToStringSubstitution. We can also implement cyclic string substitutions for the translators since I worked on functions for cyclic string substitutions.

[maxitg]

A simple method would be to have each letter correspond to a number.

Could you clarify why numbers would be easier to deal with than letters? One would still need to encode numbers as hypergraph edges unless pattern rules are used, in which case letters can be used directly.

We can have two functions, possibly ToWolframModel and ToStringSubstitution.

Maybe ToStringSubstitutionSystem? StringSubstitution sounds like a single event in a string substitution system.

We can also implement cyclic string substitutions for the translators since I worked on functions for cyclic string substitutions.

It would be helpful to add a link to your project here.