Skip to Main content Skip to Navigation
Journal articles

Birecurrent sets

Abstract : A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as reversal. We prove a series of results concerning birecurrent sets. It is already known that any birecurrent set is completely reducible (that is, such that the minimal representation of its characteristic series is completely reducible). The main result of this paper characterizes completely reducible sets as linear combinations of birecurrent sets
Document type :
Journal articles
Complete list of metadata
Contributor : Admin Upem Connect in order to contact the contributor
Submitted on : Monday, February 8, 2021 - 4:43:28 AM
Last modification on : Friday, September 16, 2022 - 1:51:27 PM

Links full text



Francesco Dolce, Dominique Perrin, Antonio Restivo, Christophe Reutenauer, Giuseppina Rindone. Birecurrent sets. International Journal of Algebra and Computation, World Scientific Publishing, 2018, 28 (04), pp.613-652. ⟨10.1142/S0218196718500285⟩. ⟨hal-03134002⟩



Record views