Formalizing Classical Telugu Prosody (Chandassu) as a Finite-State Digital Logic Architecture
Year: 2026
Type: preprint
Abstract: Classical Indian prosody—specifically Telugu Chandassu, rooted in Pingala's Chandaḥśāstra—governs poetic meter through strict syllable-duration rules (Laghu and Guru). While historical scholarship acknowledges the presence of binary representations in ancient Sanskrit combinatorics, this paper establishes a formal computational isomorphism between Telugu prosodic grammar and modern Digital Logic Design. We prove that tri-syllabic metric feet (Ganas) operate as a 3-bit combinational state space Q3, demonstrate that the classical Yamātārājabhānasalagām mnemonic realizes a cyclic De Bruijn shift register B(2,3), derive linear-time Θ(n) priority encoder and decoder recurrences (Uddiṣṭa and Naṣṭa), and prove via Karnaugh Map (K-map) minimization that structural meter filters reduce to a canonical single-wire Boolean buffer (F = A). Finally, we formulate classical poetic constraints (Yati, Prasa, and Matra counts) as XNOR equivalence and weighted checksum error-detection gates, verified exhaustively via an open-source automated proof suite.
Author: Muddasani, Vaishali
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7235355429
