Switch to: References

Add citations

You must login to add citations.
  1. Pāṇini's Grammar and Modern Computation.John Kadvany - 2016 - History and Philosophy of Logic 37 (4):325-346.
    Pāṇini's fourth century BC Sanskrit grammar uses rewrite rules utilizing an explicit formal language defined through a semi-formal metalanguage. The grammar is generative, meaning that it is capable of expressing a potential infinity of well-formed Sanskrit sentences starting from a finite symbolic inventory. The grammar's operational rules involve extensive use of auxiliary markers, in the form of Sanskrit phonemes, to control grammatical derivations. Pāṇini's rules often utilize a generic context-sensitive format to identify terms used in replacement, modification or deletion operations. (...)
    Download  
     
    Export citation  
     
    Bookmark