Synchronization problems in automata without non-trivial cycles - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2019

Synchronization problems in automata without non-trivial cycles

Résumé

We study the computational complexity of various problems related to synchronization of weakly acyclic automata, a subclass of widely studied aperiodic automata. We provide upper and lower bounds on the length of a shortest word synchronizing a weakly acyclic automaton or, more generally, a subset of its states, and show that the problem of approximating this length is hard. We investigate the complexity of finding a synchronizable set of states of maximum size. We also show inapproximability of the problem of computing the rank of a subset of states in a binary weakly acyclic automaton and prove that several problems related to recognizing a synchronizable subset of states in such automata are NP-complete.
Fichier principal
Vignette du fichier
S0304397519300040.pdf (263.96 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02942498 , version 1 (20-07-2022)

Licence

Paternité - Pas d'utilisation commerciale

Identifiants

Citer

Andrew Ryzhikov. Synchronization problems in automata without non-trivial cycles. Theoretical Computer Science, 2019, 787, pp.77-88. ⟨10.1016/j.tcs.2018.12.026⟩. ⟨hal-02942498⟩
42 Consultations
21 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More