COMPLETELY REDUCIBLE SETS
From MaRDI portal
Publication:2842026
DOI10.1142/S0218196713400158zbMath1308.68072arXiv1209.2035MaRDI QIDQ2842026
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
cyclic sets; formal languages; closure properties; bifix code; linear representations of monoids; rational sets of words
68Q45: Formal languages and automata
68Q70: Algebraic theory of languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
20M30: Representation of semigroups; actions of semigroups on sets
Related Items
Birecurrent sets, On automata recognizing 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