{"title":"Incremental Construction of Finite-State Automata","authors":"J. Daciuk","doi":"10.1201/b13055-9","DOIUrl":null,"url":null,"abstract":"Rozdzial przedstawia algorytmy przyrostowego i polprzyrostowego tworzenia minimalnych deterministycznych automatow skonczonych.","PeriodicalId":302611,"journal":{"name":"Handbook of Finite State Based Models and Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Handbook of Finite State Based Models and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1201/b13055-9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21
Abstract
Rozdzial przedstawia algorytmy przyrostowego i polprzyrostowego tworzenia minimalnych deterministycznych automatow skonczonych.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
