Semisimple Synchronizing Automata and the Wedderburn-Artin Theory

DOI10.1142/S0129054116400037zbMath1352.68172OpenAlexW4245103550MaRDI QIDQ5890812

Emanuele Rodaro, Jorge Almeida

Publication date: 23 June 2016

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054116400037

zbMATH Keywords

Černý's conjectureideal regular languagesemisimple algebrassynchronizing automatonWedderburn-Artin theoryradical word

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Simple, semisimple Jordan algebras (17C20)

Related Items (3)

Strongly connected synchronizing automata and the language of minimal reset words ⋮ A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number ⋮ Primitivity, uniform minimality, and state complexity of Boolean operations

Cites Work

• Synchronizing automata with finitely many minimal synchronizing words
• The Černý conjecture for one-cluster automata with prime length cycle
• Primitive and irreducible automata
• Synchronizing automata preserving a chain of partial orders
• Synchronizing groups and automata
• WORDS GUARANTEEING MINIMUM IMAGE
• Representation theory of finite semigroups, semigroup radicals and formal language theory

This page was built for publication: Semisimple Synchronizing Automata and the Wedderburn-Artin Theory