Alexandros Palioudakis, Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, K. Salomaa
{"title":"The State Complexity of Permutations on Finite Languages over Binary Alphabets","authors":"Alexandros Palioudakis, Da-Jung Cho, Daniel Goc, Yo-Sub Han, Sang-Ki Ko, K. Salomaa","doi":"10.1007/978-3-319-19225-3_19","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":305919,"journal":{"name":"Workshop on Descriptional Complexity of Formal Systems","volume":"135 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Descriptional Complexity of Formal Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-19225-3_19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
