剪接系统和分子过程

Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) Pub Date : 1997-04-13 DOI:10.1109/ICEC.1997.592296

T. Head

{"title":"剪接系统和分子过程","authors":"T. Head","doi":"10.1109/ICEC.1997.592296","DOIUrl":null,"url":null,"abstract":"The splicing system concept and its history are reviewed. A proposed laboratory splicing scheme is discussed. This scheme has suggested that splicing schemes be regarded as specifying not only languages, but also dynamical systems. As an example of a new formal result on splicing languages, a theorem is stated that characterizes those regular languages that are generated by splicing systems which require only one-sided context. The theorem provides an algorithm for deciding whether any arbitrary regular language can be so generated.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Splicing systems and molecular processes\",\"authors\":\"T. Head\",\"doi\":\"10.1109/ICEC.1997.592296\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The splicing system concept and its history are reviewed. A proposed laboratory splicing scheme is discussed. This scheme has suggested that splicing schemes be regarded as specifying not only languages, but also dynamical systems. As an example of a new formal result on splicing languages, a theorem is stated that characterizes those regular languages that are generated by splicing systems which require only one-sided context. The theorem provides an algorithm for deciding whether any arbitrary regular language can be so generated.\",\"PeriodicalId\":167852,\"journal\":{\"name\":\"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEC.1997.592296\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEC.1997.592296","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

综述了拼接系统的概念及其发展历史。讨论了一种实验室剪接方案。该方案表明，剪接方案不仅可以被视为指定语言，而且可以被视为指定动态系统。作为一个关于拼接语言的新的形式化结果的例子，给出了一个定理，该定理描述了那些由拼接系统生成的规则语言，这些规则语言只需要单侧上下文。该定理提供了一种算法来确定任意规则语言是否可以这样生成。

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

查看原文本刊更多论文

Splicing systems and molecular processes

The splicing system concept and its history are reviewed. A proposed laboratory splicing scheme is discussed. This scheme has suggested that splicing schemes be regarded as specifying not only languages, but also dynamical systems. As an example of a new formal result on splicing languages, a theorem is stated that characterizes those regular languages that are generated by splicing systems which require only one-sided context. The theorem provides an algorithm for deciding whether any arbitrary regular language can be so generated.

求助全文

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

来源期刊

Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)

自引率

0.00%

发文量