有限自动机子类上同步博弈的制胜策略

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-09-11 DOI:arxiv-2409.06971

Henning FernauUniversität Trier, Fachbereich IV, Informatikwissenschaften, Trier, Germany, Carolina HaaseUniversität Trier, Fachbereich IV, Informatikwissenschaften, Trier, Germany, Stefan HoffmannInstitute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg, Russia, Mikhail VolkovInstitute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg, Russia

{"title":"有限自动机子类上同步博弈的制胜策略","authors":"Henning FernauUniversität Trier, Fachbereich IV, Informatikwissenschaften, Trier, Germany, Carolina HaaseUniversität Trier, Fachbereich IV, Informatikwissenschaften, Trier, Germany, Stefan HoffmannInstitute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg, Russia, Mikhail VolkovInstitute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg, Russia","doi":"arxiv-2409.06971","DOIUrl":null,"url":null,"abstract":"We exhibit a winning strategy for Synchronizer in the synchronization game on\nevery synchronizing automaton in whose transition monoid the regular D-classes\nform subsemigroups","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Winning Strategies for the Synchronization Game on Subclasses of Finite Automata\",\"authors\":\"Henning FernauUniversität Trier, Fachbereich IV, Informatikwissenschaften, Trier, Germany, Carolina HaaseUniversität Trier, Fachbereich IV, Informatikwissenschaften, Trier, Germany, Stefan HoffmannInstitute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg, Russia, Mikhail VolkovInstitute of Natural Sciences and Mathematics, Ural Federal University, Ekaterinburg, Russia\",\"doi\":\"arxiv-2409.06971\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We exhibit a winning strategy for Synchronizer in the synchronization game on\\nevery synchronizing automaton in whose transition monoid the regular D-classes\\nform subsemigroups\",\"PeriodicalId\":501124,\"journal\":{\"name\":\"arXiv - CS - Formal Languages and Automata Theory\",\"volume\":\"1 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.06971\",\"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.06971","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们展示了同步器在同步博弈中的制胜策略，即在每一个同步自动机中，其过渡单元中的正则 D 类都构成子组

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Winning Strategies for the Synchronization Game on Subclasses of Finite Automata

We exhibit a winning strategy for Synchronizer in the synchronization game on every synchronizing automaton in whose transition monoid the regular D-classes form subsemigroups

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - CS - Formal Languages and Automata Theory

自引率

0.00%

发文量

期刊最新文献

Query Learning of Advice and Nominal Automata Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny Run supports and initial algebra supports of weighted automata Alternating hierarchy of sushifts defined by nondeterministic plane-walking automata $\mathbb{N}$-polyregular functions arise from well-quasi-orderings