COMPLETELY REDUCIBLE SETS

DOI10.1142/S0218196713400158zbMath1308.68072arXiv1209.2035OpenAlexW2963982743MaRDI QIDQ2842026

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

cyclic setsformal languagesclosure propertiesbifix codelinear representations of monoidsrational sets of words

Mathematics Subject Classification ID

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

Related Items (4)

On automata recognizing birecurrent sets ⋮ Birecurrent sets ⋮ Simplicity of augmentation submodules for transformation monoids ⋮ Character theory of monoids over an arbitrary field.

Cites Work

• Series formelles et algèbres syntactiques
• Semisimplicity of the algebra associated to a biprefix code
• Characters of finite semigroups
• Representation theory of finite semigroups, semigroup radicals and formal language theory
• An Introduction to Symbolic Dynamics and Coding
• Characters and complexity of finite semigroups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: COMPLETELY REDUCIBLE SETS