{"title":"The complexity of a counting finite-state automation","authors":"C. Rich, G. Slutzki","doi":"10.1007/3-540-50517-2_83","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":42512,"journal":{"name":"Acta Cybernetica","volume":"20 1","pages":"225-239"},"PeriodicalIF":0.3000,"publicationDate":"1988-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Cybernetica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-50517-2_83","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
