DocumentCode
1850896
Title
P Systems Based on Sticker Operations
Author
Masilamani, V. ; Venkatesan, A. S Prasanna ; Thomas, D.G.
Author_Institution
Dept. of Comput. Sci. & Eng., IIITD&M Kancheepuram, Chennai, India
fYear
2011
fDate
27-29 Sept. 2011
Firstpage
199
Lastpage
204
Abstract
Sticker systems, a computability model introduced by L. Kari et al. (1998) are language generating devices based on the sticker operation. In this paper, a theoretical study about a new class of P system based on the sticker operation has been presented. Such a system has double stranded sequences with sticky ends as objects and sticker operations as evolution rules in its regions. We compare the language generated by this system with regular languages.
Keywords
biocomputing; computational complexity; formal languages; P systems; computability model; double stranded sequences; evolution rules; language generating devices; regular languages; sticker operations; sticky ends; Computational modeling; DNA; Educational institutions; Electronic mail; Grammar; Mathematical model; DNA computing; Formal languages; Membrane computing; P system; Sticker systems;
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.52
Filename
6046898
Link To Document