When you study a deterministic sequence running into thousands of symbols, summary statistics alone don't tell the full story. You need multiple geometric and topological angles to see what the grammar is actually doing.
In the Engineering of Alphabets (EOA) program, we apply a deterministic recursive operator to phonetic letter encodings. Starting with the spoken name of the letter "a", the system generates a discrete sequence with strictly linear factor complexity and an asymptotic growth ratio near $\pi$ ($\lambda \approx 3.141593$).
To audit its properties without relying on hand-waving, our analysis tool—eoa_sequence_visualizer_v4.1—generates a 12-panel diagnostic suite. Rather than just making generative art, each panel isolates a specific dynamical property: subword graphs, recurrence matrices, topological entropy ladders, and surrogate controls.
Below is the complete 12-panel breakdown extracted from the verified 2,500-symbol prefix.
Panel 1 — Symbolic Turtle Rendering
L-system path tracing where symbols govern rotation and forward translation step-by-step.
Panel 2 — Chaos Game Representation (CGR)
Fractal-space mapping tracking how consecutive subwords distribute across the state space.
Panel 3 — Symbolic Recurrence Matrix
2D recurrence plot exposing exact long-range repetitions, bounded gaps, and diagonal lines.
Panel 4 — Rewrite Engine Waveform
Amplitude signal showing discrete state transitions generated by successive rewrite rounds.
Panel 5 — Empirical Eigenvector Projection
2D projection along the dominant eigenvectors of the letter transition spectrum.
Panel 6 — Subword Transition Graph (Rauzy Graph)
Directed network showing factor connectivity and isolating the small 4-symbol branching core.
Panel 7 — Desubstitution Test
Inverse-morphism scan testing whether recurrent blocks collapse back into a primitive substitution rule.
Panel 8 — Factor Complexity $p(k)$ vs $k$
Counting distinct subwords up to length 30; confirms strictly linear subword growth.
Panel 9 — Abelian Complexity $a(k)$ vs $k$
Subword complexity under Parikh vectors, evaluating permutation symmetry across words.
Panel 10 — Finite-Sample Block-Growth Ladder
Comparing empirical graph spectral radius against observed block growth to test the zero-entropy boundary.
Panel 11 — Prefix-Frequency Discrepancy
Measuring balance and deviation of letter counts against expected asymptotic frequencies.
Panel 12 — Surrogate Controls
Null-model benchmarks testing the sequence against random shuffles and order-1 Markov surrogates.
Open Data & Verification
All raw data, checksums, and technical notes are openly available for independent analysis:
- 📦 Zenodo Record: doi.org/10.5281/zenodo.23019059
- 📂 GitHub Repository: bahaa-budargham/eoa-symbolic-sequences
- 🌐 Research Portal: research.neurolabs.space
Top comments (0)