تقرير
A characterization of those automata that structurally generate finite groups
| العنوان: | A characterization of those automata that structurally generate finite groups |
|---|---|
| المؤلفون: | Klimann, Ines, Picantin, Matthieu |
| سنة النشر: | 2013 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Computer Science - Formal Languages and Automata Theory, Mathematics - Group Theory |
| الوصف: | Antonenko and Russyev independently have shown that any Mealy automaton with no cycles with exit--that is, where every cycle in the underlying directed graph is a sink component--generates a fi- nite (semi)group, regardless of the choice of the production functions. Antonenko has proved that this constitutes a characterization in the non-invertible case and asked for the invertible case, which is proved in this paper. |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/1310.7137 |
| رقم الأكسشن: | edsarx.1310.7137 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |