{"title":"区块语言的运行状态复杂性","authors":"Guilherme DuarteCMUP & FCUP, Nelma MoreiraCMUP & FCUP, Luca PrigionieroUniversity of Loughborough, Rogério ReisCMUP & FCUP","doi":"arxiv-2409.06970","DOIUrl":null,"url":null,"abstract":"In this paper we consider block languages, namely sets of words having the\nsame length, and study the deterministic and nondeterministic state complexity\nof several operations on these languages. Being a subclass of finite languages,\nthe upper bounds of operational state complexity known for finite languages\napply for block languages as well. However, in several cases, smaller values\nwere found. Block languages can be represented as bitmaps, which are a good\ntool to study their minimal finite automata and their operations, as we\nillustrate here.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"2 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Operational State Complexity of Block Languages\",\"authors\":\"Guilherme DuarteCMUP & FCUP, Nelma MoreiraCMUP & FCUP, Luca PrigionieroUniversity of Loughborough, Rogério ReisCMUP & FCUP\",\"doi\":\"arxiv-2409.06970\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider block languages, namely sets of words having the\\nsame length, and study the deterministic and nondeterministic state complexity\\nof several operations on these languages. Being a subclass of finite languages,\\nthe upper bounds of operational state complexity known for finite languages\\napply for block languages as well. However, in several cases, smaller values\\nwere found. Block languages can be represented as bitmaps, which are a good\\ntool to study their minimal finite automata and their operations, as we\\nillustrate here.\",\"PeriodicalId\":501124,\"journal\":{\"name\":\"arXiv - CS - Formal Languages and Automata Theory\",\"volume\":\"2 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Formal Languages and Automata Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.06970\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Formal Languages and Automata Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.06970","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper we consider block languages, namely sets of words having the
same length, and study the deterministic and nondeterministic state complexity
of several operations on these languages. Being a subclass of finite languages,
the upper bounds of operational state complexity known for finite languages
apply for block languages as well. However, in several cases, smaller values
were found. Block languages can be represented as bitmaps, which are a good
tool to study their minimal finite automata and their operations, as we
illustrate here.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
