On the construction of Śivasūtras-alphabets

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the present paper, a formalization of the technique used by Pāini in his Śivasūtras for the denotation of sound classes is given. Furthermore, a general notion of Śivasūtras-alphabets and of Śivasūtras-sortability is developed. The presented main theorem poses three sufficient conditions for the Śivasūtras-sortability of sets of classes. Finally, the problem of ordering sets of classes which are not Śivasūtras-sortable is tackled and an outlook on modern problems which could be approached by Pāini technique is given. © 2009 Springer Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Petersen, W. (2009). On the construction of Śivasūtras-alphabets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5406 LNAI, pp. 78–97). Springer Verlag. https://doi.org/10.1007/978-3-540-93885-9_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free