End Justified Post Turing Rewriting Systems and M-Grammar
Yamarthi Narasimha Rao, Yashaswi Vemuganti, E. G. Rajan · 2012
This paper deals with the formulation of a non-Chosky grammar called M-grammar which defines the language of End Justified Post Turing Rewriting Systems. Formulation of this grammar has solved the Problem of Generating Markov Class Rewriting Systems By a Type-0 Phrase Structure Grammar.