{"title":"绑定-阻塞自动机的性质研究","authors":"M. Balan","doi":"10.1109/BIC-TA.2011.73","DOIUrl":null,"url":null,"abstract":"Binding-Blocking Automata is an automaton model that is inspired by peptide computing. This is a finite state automaton together with the facility to postpone the reading of some symbols to a later part of time by blocking of symbols. In this paper, we study some of the properties of binding-blocking automaton using a measure called blocking quotient and show that any Binding-Blocking Automata can accept only languages where the length grows in a linear fashion. This is the first attempt to study the properties of binding-blocking automata and we feel that this will lead us to investigate further into the properties of this automaton model.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Properties of Binding-Blocking Automata: A Study\",\"authors\":\"M. Balan\",\"doi\":\"10.1109/BIC-TA.2011.73\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Binding-Blocking Automata is an automaton model that is inspired by peptide computing. This is a finite state automaton together with the facility to postpone the reading of some symbols to a later part of time by blocking of symbols. In this paper, we study some of the properties of binding-blocking automaton using a measure called blocking quotient and show that any Binding-Blocking Automata can accept only languages where the length grows in a linear fashion. This is the first attempt to study the properties of binding-blocking automata and we feel that this will lead us to investigate further into the properties of this automaton model.\",\"PeriodicalId\":211822,\"journal\":{\"name\":\"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BIC-TA.2011.73\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIC-TA.2011.73","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Binding-Blocking Automata is an automaton model that is inspired by peptide computing. This is a finite state automaton together with the facility to postpone the reading of some symbols to a later part of time by blocking of symbols. In this paper, we study some of the properties of binding-blocking automaton using a measure called blocking quotient and show that any Binding-Blocking Automata can accept only languages where the length grows in a linear fashion. This is the first attempt to study the properties of binding-blocking automata and we feel that this will lead us to investigate further into the properties of this automaton model.