循环自动机的简单位置与不可约性
Simplicity and irreducibility in circular automata
AI总结:
本文研究了循环DFA在何种条件下为简单(有时称为原始)或不可约。作者提出的不可约性定义与经典定义略有不同,因monoid表示是在复数域而非有理数域上进行的。文章通过弱收缩性质完全描述了循环情况下的简单性,并为强收缩自动机提供了不可约性的必要充分条件。
摘要:
本文研究了循环DFA在何种条件下为简单(有时称为原始)或不可约。作者提出的不可约性定义与经典定义略有不同,因monoid表示是在复数域而非有理数域上进行的。文章通过弱收缩性质完全描述了循环情况下的简单性,并为强收缩自动机提供了不可约性的必要充分条件。
英文摘要:
This paper investigates the conditions under which a given circular (synchronizing) DFA is \emph{simple} (sometimes referred to as \emph{primitive}) and when it is \emph{irreducible}. Our notion of irreducibility slightly differs from the classical one, since we are considering our monoid representations to be over $\mathbb{C}$ instead of $\mathbb{Q}$; nevertheless, several well-known results remain valid-for instance, the fact that every irreducible automaton is necessarily simple. We provide a complete characterization of simplicity in the circular case by means of the \emph{weak contracting property}. Furthermore, we establish necessary and sufficient conditions for a circular \emph{contracting automaton} (a stronger condition than the weakly contracting one) to be irreducible, and we present examples illustrating our results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。