DocumentCode
1850069
Title
Parallel Communicating Graph Grammar
Author
Bharathi, S. Jeya ; Vadivu, M. Saravana ; Thiagarajan, K.
Author_Institution
Dept. of Math., Thiagarajar Coll. of Eng., Madurai, India
fYear
2011
fDate
27-29 Sept. 2011
Firstpage
27
Lastpage
32
Abstract
In a Parallel Communicating Grammar System the components of a grammar system can also work in parallel (each having its own rewriting form) and communicate to each other in some way(sending the currently generated resultant graph to other components). In this paper we define parallel communicating edNCE graph grammar and parallel communicating ETPL(k) graph grammar. We present the condition to determine the parsing of a parallel communicating NCE graph grammar. PCedNCE graph grammar is found to be powerful than PCETPL(k) graph grammar.
Keywords
grammars; graph theory; parallel processing; PCETPL; PCedNCE graph grammar; parallel communicating edNCE graph grammar; Computational modeling; Context; Educational institutions; Grammar; Polynomials; Production; Confluent; ETPL(k); IE graph; PCedNCE graph grammar; Parallel communicating system;
fLanguage
English
Publisher
ieee
Conference_Titel
Bio-Inspired Computing: Theories and Applications (BIC-TA), 2011 Sixth International Conference on
Conference_Location
Penang
Print_ISBN
978-1-4577-1092-6
Type
conf
DOI
10.1109/BIC-TA.2011.2
Filename
6046868
Link To Document