Birecurrent sets

DOI10.1142/S0218196718500285zbMath1395.68166arXiv1703.10081OpenAlexW2795834488MaRDI QIDQ4576007

Francesco Dolce, Christophe Reutenauer, Giuseppina Rindone, Dominique Perrin, Antonio Restivo

Publication date: 12 July 2018

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.10081

zbMATH Keywords

regular languagefinite automatonprefix codeformal seriesbifix coderecurrent setbirecurrent set

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

On automata recognizing birecurrent sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Une topologie du monoide libre
• Semisimplicity of the algebra associated to a biprefix code
• On automata recognizing birecurrent sets
• COMPLETELY REDUCIBLE SETS
• Inference of Reversible Languages
• SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES
• Codes asynchrones
• On a Special Class of Recurrent Events

This page was built for publication: Birecurrent sets