Welcome to the InfoSci Platform
Sticker P System

Sticker P System

A. S. Prasanna Venkatesan, V. Masilamani, D. G. Thomas
Copyright: © 2012 |Volume: 3 |Issue: 1 |Pages: 16
ISSN: 1947-928X|EISSN: 1947-9298|EISBN13: 9781466613652|DOI: 10.4018/jncr.2012010103
Cite Article Cite Article

MLA

Venkatesan, A. S. Prasanna, et al. "Sticker P System." IJNCR vol.3, no.1 2012: pp.28-43. http://doi.org/10.4018/jncr.2012010103

APA

Venkatesan, A. S., Masilamani, V., & Thomas, D. G. (2012). Sticker P System. International Journal of Natural Computing Research (IJNCR), 3(1), 28-43. http://doi.org/10.4018/jncr.2012010103

Chicago

Venkatesan, A. S. Prasanna, V. Masilamani, and D. G. Thomas. "Sticker P System," International Journal of Natural Computing Research (IJNCR) 3, no.1: 28-43. http://doi.org/10.4018/jncr.2012010103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

A computability model based on DNA sequences called sticker systems was introduced by Kari et al. (1998). Sticker systems are language generating devices based on the sticker operation. In this work, a theoretical study about a new class of P system based on the sticker operation has been proposed. In this system, objects are double stranded sequences with sticky ends and evolution rules are sticking rules based on sticker operation. The authors compare the language generated by the proposed system with regular languages. The authors suggest another P system based on the bidirectional sticker system.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.