On automata recognizing birecurrent sets - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2019

On automata recognizing birecurrent sets

Résumé

In this note we study automata recognizing birecurrent sets. A set of words is called birecurrent if the minimal partial DFA recognizing this set and the minimal partial DFA recognizing the reversal of this set are both strongly connected. This notion was introduced by Perrin, and Dolce et al. provided a characterization of such sets. We prove that deciding whether a partial DFA recognizes a birecurrent set is a PSPACE-complete problem. We show that this problem is PSPACE-complete even in the case of binary partial DFAs with all states accepting and in the case of binary complete DFAs.

Dates et versions

hal-02942496 , version 1 (18-09-2020)

Identifiants

Citer

Andrew Ryzhikov. On automata recognizing birecurrent sets. Theoretical Computer Science, 2019, 753, pp.76-79. ⟨10.1016/j.tcs.2018.06.043⟩. ⟨hal-02942496⟩
39 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More