Synchronizing Automata over Nested Words - Archive ouverte HAL
Article Dans Une Revue Journal of Automata Languages and Combinatorics Année : 2019

Synchronizing Automata over Nested Words

Résumé

We extend the concept of a synchronizing word from deterministic finite-state automata (DFA) to nested word automata (NWA): A well-matched nested word is called synchronizing if it resets the control state of any configuration, i.e., takes the NWA from all control states to a single control state. We show that although the shortest synchronizing word for an NWA, if it exists, can be (at most) exponential in the size of the NWA, the existence of such a word can still be decided in polynomial time. As our main contribution, we show that deciding the existence of a short synchronizing word (of at most given length) becomes PSPACE-complete (as opposed to NP-complete for DFA). The upper bound makes a connection to pebble games and Strahler numbers, and the lower bound goes via smallcost synchronizing words for DFA, an intermediate problem that we also show PSPACEcomplete. We also characterize the complexity of a number of related problems, using the observation that the intersection nonemptiness problem for NWA is EXP-complete.
Fichier principal
Vignette du fichier
Synchronizing_automata_over_nested_words.pdf (684.79 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02411524 , version 1 (29-12-2020)

Identifiants

Citer

Dmitry Chistikov, Pavel Martyugin, Mahsa Shirmohammadi. Synchronizing Automata over Nested Words. Journal of Automata Languages and Combinatorics, 2019, 24 (2-4), pp.219--251. ⟨10.25596/jalc-2019-219⟩. ⟨hal-02411524⟩
24 Consultations
122 Téléchargements

Altmetric

Partager

More