沃森-克里克自动机的语言识别能力:多头和传感

2012 Third International Conference on Networking and Computing Pub Date : 2012-12-05 DOI:10.1109/ICNC.2012.69

K. Aizawa, Masayuki Aoyama, Kazuki Murakami

{"title":"沃森-克里克自动机的语言识别能力:多头和传感","authors":"K. Aizawa, Masayuki Aoyama, Kazuki Murakami","doi":"10.1109/ICNC.2012.69","DOIUrl":null,"url":null,"abstract":"A Watson-Crick automaton is introduced as a computational model of DNA computing framework. In this paper, we introduce a 3-head reverse Watson-Crick finite automaton having three read-only heads but no sensing power. We show that the class of 3-head reverse Watson-Crick finite automata includes the class of simple sticker language and full reading sensing 5'->;3' Watson-Crick finite automata.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Language Recognition Power of Watson-Crick Automata: Multiheads and Sensing\",\"authors\":\"K. Aizawa, Masayuki Aoyama, Kazuki Murakami\",\"doi\":\"10.1109/ICNC.2012.69\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A Watson-Crick automaton is introduced as a computational model of DNA computing framework. In this paper, we introduce a 3-head reverse Watson-Crick finite automaton having three read-only heads but no sensing power. We show that the class of 3-head reverse Watson-Crick finite automata includes the class of simple sticker language and full reading sensing 5'->;3' Watson-Crick finite automata.\",\"PeriodicalId\":442973,\"journal\":{\"name\":\"2012 Third International Conference on Networking and Computing\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Third International Conference on Networking and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2012.69\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Third International Conference on Networking and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2012.69","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

引入了一个沃森-克里克自动机作为DNA计算框架的计算模型。本文介绍了一种具有三个只读头但没有传感能力的3头反向沃森-克里克有限自动机。我们证明了3头反向沃森-克里克有限自动机类包括简单贴纸语言类和完整阅读传感5'->;3'沃森-克里克有限自动机。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Language Recognition Power of Watson-Crick Automata: Multiheads and Sensing

A Watson-Crick automaton is introduced as a computational model of DNA computing framework. In this paper, we introduce a 3-head reverse Watson-Crick finite automaton having three read-only heads but no sensing power. We show that the class of 3-head reverse Watson-Crick finite automata includes the class of simple sticker language and full reading sensing 5'->;3' Watson-Crick finite automata.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2012 Third International Conference on Networking and Computing

自引率

0.00%

发文量