{"title":"计算动词有限状态机模型","authors":"Muchenxuan Tong, Tao Yang","doi":"10.1109/ICASID.2010.5551492","DOIUrl":null,"url":null,"abstract":"In this paper, a model of computational verb finite-state machines is introduced. This model extends fuzzy state machines with computational verb logic and is able to make transition bases on the dynamics of inputs and internal states. The model is very general and will provide a new perspective for solving problems in many fields.","PeriodicalId":391931,"journal":{"name":"2010 International Conference on Anti-Counterfeiting, Security and Identification","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A model of computational verb finite-state machines\",\"authors\":\"Muchenxuan Tong, Tao Yang\",\"doi\":\"10.1109/ICASID.2010.5551492\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a model of computational verb finite-state machines is introduced. This model extends fuzzy state machines with computational verb logic and is able to make transition bases on the dynamics of inputs and internal states. The model is very general and will provide a new perspective for solving problems in many fields.\",\"PeriodicalId\":391931,\"journal\":{\"name\":\"2010 International Conference on Anti-Counterfeiting, Security and Identification\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Anti-Counterfeiting, Security and Identification\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASID.2010.5551492\",\"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 International Conference on Anti-Counterfeiting, Security and Identification","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASID.2010.5551492","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A model of computational verb finite-state machines
In this paper, a model of computational verb finite-state machines is introduced. This model extends fuzzy state machines with computational verb logic and is able to make transition bases on the dynamics of inputs and internal states. The model is very general and will provide a new perspective for solving problems in many fields.