Formalizing Classical Telugu Prosody (Chandassu) as a Finite-State Digital Logic Architecture

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.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-17
DOI
https://doi.org/10.5281/zenodo.24304301
Primary Topic
semigroups and automata theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Formalizing Classical Telugu Prosody (Chandassu) as a Finite-State Digital Logic Architecture

Vaishali Muddasani
Zenodo (CERN European Organization for Nuclear Research)
semigroups and automata theory
preprint

Formalizing Classical Telugu Prosody (Chandassu) as a Finite-State Digital Logic Architecture

Vaishali Muddasani
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
semigroups and automata theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon