Antonio Casares, Olivier Idir, Denis Kuperberg, Corto Mascle, Aditya Prakash
{"title":"论确定性和历史确定性广义（共）布奇自动机的最小化","authors":"Antonio Casares, Olivier Idir, Denis Kuperberg, Corto Mascle, Aditya Prakash","doi":"arxiv-2407.18090","DOIUrl":null,"url":null,"abstract":"We present a polynomial-time algorithm minimising the number of states of\nhistory-deterministic generalised coB\\\"uchi automata, building on the work of\nAbu Radi and Kupferman on coB\\\"uchi automata. On the other hand, we establish\nthat the minimisation problem for both deterministic and history-deterministic\ngeneralised B\\\"uchi automata is NP-complete, as well as the problem of\nminimising at the same time the number of states and colours of\nhistory-deterministic generalised coB\\\"uchi automata.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"86 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata\",\"authors\":\"Antonio Casares, Olivier Idir, Denis Kuperberg, Corto Mascle, Aditya Prakash\",\"doi\":\"arxiv-2407.18090\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a polynomial-time algorithm minimising the number of states of\\nhistory-deterministic generalised coB\\\\\\\"uchi automata, building on the work of\\nAbu Radi and Kupferman on coB\\\\\\\"uchi automata. On the other hand, we establish\\nthat the minimisation problem for both deterministic and history-deterministic\\ngeneralised B\\\\\\\"uchi automata is NP-complete, as well as the problem of\\nminimising at the same time the number of states and colours of\\nhistory-deterministic generalised coB\\\\\\\"uchi automata.\",\"PeriodicalId\":501124,\"journal\":{\"name\":\"arXiv - CS - Formal Languages and Automata Theory\",\"volume\":\"86 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-25\",\"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-2407.18090\",\"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-2407.18090","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata
We present a polynomial-time algorithm minimising the number of states of
history-deterministic generalised coB\"uchi automata, building on the work of
Abu Radi and Kupferman on coB\"uchi automata. On the other hand, we establish
that the minimisation problem for both deterministic and history-deterministic
generalised B\"uchi automata is NP-complete, as well as the problem of
minimising at the same time the number of states and colours of
history-deterministic generalised coB\"uchi automata.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
