Winning Strategies for the Synchronization Game on Subclasses of Finite Automata

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":"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}
引用次数: 0

Abstract

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
有限自动机子类上同步博弈的制胜策略
我们展示了同步器在同步博弈中的制胜策略,即在每一个同步自动机中,其过渡单元中的正则 D 类都构成子组
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信