License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FUN.2022.14
URN: urn:nbn:de:0030-drops-159842
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/15984/
Fernau, Henning ;
Haase, Carolina ;
Hoffmann, Stefan
The Synchronization Game on Subclasses of Automata
Abstract
The notion of synchronization of finite automata is connected to one of the long-standing open problems in combinatorial automata theory, which is Černý’s Conjecture. In this paper, we focus on so-called synchronization games. We will discuss how to present synchronization questions in a playful way. This leads us to study related complexity questions on certain classes of finite automata. More precisely, we consider weakly acyclic, commutative and k-simple idempotent automata. We encounter a number of complexity classes, ranging from L up to PSPACE.
BibTeX - Entry
@InProceedings{fernau_et_al:LIPIcs.FUN.2022.14,
author = {Fernau, Henning and Haase, Carolina and Hoffmann, Stefan},
title = {{The Synchronization Game on Subclasses of Automata}},
booktitle = {11th International Conference on Fun with Algorithms (FUN 2022)},
pages = {14:1--14:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-232-7},
ISSN = {1868-8969},
year = {2022},
volume = {226},
editor = {Fraigniaud, Pierre and Uno, Yushi},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/15984},
URN = {urn:nbn:de:0030-drops-159842},
doi = {10.4230/LIPIcs.FUN.2022.14},
annote = {Keywords: Synchronization of finite automata, computational complexity}
}
|
Keywords: |
|
Synchronization of finite automata, computational complexity |
|
Collection: |
|
11th International Conference on Fun with Algorithms (FUN 2022) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
23.05.2022 |
