An Improved Generalized Enumeration of Substitution Systems

Abstract
The enumeration of all sequential substitution system rulesets is modified to include generalized substitution system rulesets. Unlike its predecessor, the new enumeration is one-to-one: each ruleset is guaranteed to appear exactly once in the new enumeration, which moreover possesses an elegant simplicity that allows jumps over increasingly longer undesired subsequences of many types. This process effectively results in an increased acceleration and greatly improved performance.