Semisimplicity of the algebra associated to a biprefix code

DOI10.1007/BF02676657zbMath0481.68076OpenAlexW2016948883WikidataQ126211569 ScholiaQ126211569MaRDI QIDQ1162366

Christophe Reutenauer

Publication date: 1981

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/134526

zbMATH Keywords

complete rational codesyntactic algebras of free submonoids of a free monoid

Mathematics Subject Classification ID

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

Related Items (6)

Zeta Functions of Formal Languages ⋮ Birecurrent sets ⋮ Endomorphism algebras of peak $I$-spaces over posets of infinite prinjective type ⋮ Ensembles libres de chemins dans un graphe ⋮ On the separator of subsets of semigroups. ⋮ COMPLETELY REDUCIBLE SETS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synchronization and simplification
• Series formelles et algèbres syntactiques
• Irreducible Matrix Representations of Finite Semigroups
• On a Special Class of Recurrent Events

This page was built for publication: Semisimplicity of the algebra associated to a biprefix code