This study presents a structural analysis of a tightly bounded cluster of Indus inscriptions centered on the AUF and AUQ openings, using data extracted from Mahadevan's The Indus Script: Texts, Concordance and Tables (MASI‑77). The goal is not decipherment, but the identification of formal constraints: repeatable openings, bounded continuations, and suffix‑like terminal slots. The result is a micro‑grammar that models these inscriptions as: CORE + STROKE‑GROUP + TAIL This grammar is compact, predictive, and falsifiable. It provides a structural engine for analyzing, validating, and generating AUF/AUQ‑type sequences.
Ky Nash (Thu,) studied this question.