沃森-克里克在线镶嵌自动机和定时沃森-克里克ω自动机

2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI:10.1109/BICTA.2010.5645070

M. Samuel, V. Dare

{"title":"沃森-克里克在线镶嵌自动机和定时沃森-克里克ω自动机","authors":"M. Samuel, V. Dare","doi":"10.1109/BICTA.2010.5645070","DOIUrl":null,"url":null,"abstract":"Watson-Crick finite automata are language recognizing devices similar to finite automata introduced in DNA computing area. We define Watson-Crick online tessellation automata which works on double-stranded arrays where the two strands relate to each other through a complementary relation inspired by the DNA complementarity. Some computational power of this automaton is dealt with. Also we define timed Watson-Crick ω-automaton and some equivalence results have been established.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Watson-Crick online tessellation automaton and timed Watson-Crick ω-automaton\",\"authors\":\"M. Samuel, V. Dare\",\"doi\":\"10.1109/BICTA.2010.5645070\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Watson-Crick finite automata are language recognizing devices similar to finite automata introduced in DNA computing area. We define Watson-Crick online tessellation automata which works on double-stranded arrays where the two strands relate to each other through a complementary relation inspired by the DNA complementarity. Some computational power of this automaton is dealt with. Also we define timed Watson-Crick ω-automaton and some equivalence results have been established.\",\"PeriodicalId\":302619,\"journal\":{\"name\":\"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)\",\"volume\":\"139 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BICTA.2010.5645070\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BICTA.2010.5645070","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

沃森-克里克有限自动机是在DNA计算领域引入的类似有限自动机的语言识别装置。我们定义了沃森-克里克在线镶嵌自动机，它适用于双链阵列，其中两条链通过受DNA互补性启发的互补关系相互关联。讨论了该自动机的一些计算能力。定义了定时沃森-克里克ω自动机，并得到了一些等价结果。

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

查看原文本刊更多论文

Watson-Crick online tessellation automaton and timed Watson-Crick ω-automaton

Watson-Crick finite automata are language recognizing devices similar to finite automata introduced in DNA computing area. We define Watson-Crick online tessellation automata which works on double-stranded arrays where the two strands relate to each other through a complementary relation inspired by the DNA complementarity. Some computational power of this automaton is dealt with. Also we define timed Watson-Crick ω-automaton and some equivalence results have been established.

求助全文

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

来源期刊

2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)

自引率

0.00%

发文量