{"title":"有限状态机的复杂性作为理解软件进化的工具","authors":"J. Rhodes","doi":"10.1109/SE.2007.18","DOIUrl":null,"url":null,"abstract":"Summary form only given. We first briefly outline the complexity of finite automata following the soon-to-be published book [Rhodes, in press]. We then extend the complexity definitions to recent research on Software Complexity, and then explore how the complexity changes as the software systems evolve. These results are compared to previously-obtained results relating to evolution of biological systems. This talk is intended for a general audience interested in Software Evolution.","PeriodicalId":155468,"journal":{"name":"Third International IEEE Workshop on Software Evolvability 2007","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Complexity of Finite State Machines as a Tool for Understanding Software Evolution\",\"authors\":\"J. Rhodes\",\"doi\":\"10.1109/SE.2007.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary form only given. We first briefly outline the complexity of finite automata following the soon-to-be published book [Rhodes, in press]. We then extend the complexity definitions to recent research on Software Complexity, and then explore how the complexity changes as the software systems evolve. These results are compared to previously-obtained results relating to evolution of biological systems. This talk is intended for a general audience interested in Software Evolution.\",\"PeriodicalId\":155468,\"journal\":{\"name\":\"Third International IEEE Workshop on Software Evolvability 2007\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International IEEE Workshop on Software Evolvability 2007\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SE.2007.18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International IEEE Workshop on Software Evolvability 2007","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SE.2007.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Complexity of Finite State Machines as a Tool for Understanding Software Evolution
Summary form only given. We first briefly outline the complexity of finite automata following the soon-to-be published book [Rhodes, in press]. We then extend the complexity definitions to recent research on Software Complexity, and then explore how the complexity changes as the software systems evolve. These results are compared to previously-obtained results relating to evolution of biological systems. This talk is intended for a general audience interested in Software Evolution.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
