arXiv · 2611.18661
Non-Deterministic Finite Automata for Telugu Letters and Visualizations for Metrical Poetry
Abstract
Syllabic weight is central to Telugu metrical poetry. Syllabically, every letter (aksharam token) is either light (laghuvu) or heavy (guruvu). Poets classify it using a set of pre-defined rules. This paper formalizes aksharam token, the atomic unit of syllabic classification, as a non-deterministic finite automaton (NFA) with the regular expression$\colon$ $(A_h+A_d+A_p)(ε+V_s)+A_m+H^+G(ε+H+V_s+V_v)$, where $ε$ denotes a null string, $A$ denotes a vowel (achchu), comprising hrasvam ($A_h$), deergham ($A_d$), plutham ($A_p$), and miscellaneous ($A_m$), $H$ a pure consonant (pollu\_hallu), $G$ a vowel diacritic (gunintha\_chihnam), $V_s$ the sunna (anusvara), and $V_v$ the visarga, the latter two being nasal and aspirated sounds respectively. We then present automata diagrams and regular expressions for (i) a necessary condition satisfied by every light letter, and (ii) a sufficient condition for a letter to be heavy. Finally, we propose graphical visualizations for the 9 Telugu poem types.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Boddu Sri Pavan, Chandrasheker Thummanagoti, Appana Mohan Naga Phani Kumar, Boddu Swathi Sree. 2026-10-19. Non-Deterministic Finite Automata for Telugu Letters and Visualizations for Metrical Poetry. https://searcharxiv.com/abs/2611.18661
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.