Completely reducible sets

DOI10.1142/S0218196713400158MaRDI QIDQ2842026zbMATH OpenOpenAlexFDO

Authors Dominique Perrin

Publication date 30 July 2013

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

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

zbMATH Keywords

bifix codeclosure propertiescyclic setsformal languageslinear representations of monoidsrational sets of words

Mathematics Subject Classification ID

Representation of semigroups; actions of semigroups on sets (20M30) Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Abstract: We study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the submonoids generated by bifix codes and, by a result of Berstel and Reutenauer, the cyclic sets. We study the closure properties of this family. We prove a result on linear representations of monoids which gives a generalization of the result concerning the complete reducibility of the submonoid generated by a bifix code to sets called birecurrent. We also give a new proof of the result concerning cyclic sets.

Recommendations

• Birecurrent sets
• scientific article; zbMATH DE number 4003555
• scientific article; zbMATH DE number 4092800
• scientific article; zbMATH DE number 942725
• Maximal bifix decoding

Cites work

• An Introduction to Symbolic Dynamics and Coding
• Characters and complexity of finite semigroups
• Characters of finite semigroups
• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• Noncommutative rational series with applications
• Representation theory of finite semigroups, semigroup radicals and formal language theory
• Semisimplicity of the algebra associated to a biprefix code
• Series formelles et algèbres syntactiques

Cited in

(5)

• On automata recognizing birecurrent sets
• Simplicity of augmentation submodules for transformation monoids
• Character theory of monoids over an arbitrary field.
• Birecurrent sets
• Decorated one-dimensional cobordisms and tensor envelopes of noncommutative recognizable power series

This page was built for publication: Completely reducible sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842026)