DocumentCode :
2678767
Title :
End Justified Post Turing Rewriting Systems and M-Grammar
Author :
Rao, Y. Narasimha ; Vemuganti, Yashaswi ; Rajan, E.G.
Author_Institution :
Anna Univ. Coimbatore, Coimbatore, India
fYear :
2012
fDate :
14-15 Sept. 2012
Firstpage :
43
Lastpage :
46
Abstract :
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.
Keywords :
Markov processes; formal languages; rewriting systems; M-grammar; end justified post turing rewriting systems; formal grammar; formal languages; generating Markov class rewriting system problem; non Chosky grammar; string manipulation language; type-0 phrase structure grammar; Companies; Grammar; Markov processes; Production; Publishing; Signal processing algorithms; Turing machines; Chomsky hierarchy; formal grammar; semi-Thue production; string manipulation language;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computing Sciences (ICCS), 2012 International Conference on
Conference_Location :
Phagwara
Print_ISBN :
978-1-4673-2647-6
Type :
conf
DOI :
10.1109/ICCS.2012.33
Filename :
6391644
Link To Document :
بازگشت