Groups and semigroups defined by colorings of synchronizing automata
نویسندگان
چکیده
منابع مشابه
Groups and Semigroups Defined by Colorings of Synchronizing Automata
In this paper we combine the algebraic properties of Mealy machines generating self-similar groups and the combinatorial properties of the corresponding deterministic finite automata (DFA). In particular, we relate bounded automata to finitely generated synchronizing automata and characterize finite automata groups in terms of nilpotency of the corresponding DFA. Moreover, we present a decidabl...
متن کاملGroups and Semigroups Defined by some Classes of Mealy Automata
Two classes of finite Mealy automata (automata without branches, slowmoving automata) are considered in this article. We study algebraic properties of transformations defined by automata of these classes. We consider groups and semigroups defined by automata without branches.
متن کاملSynchronizing groups and automata
Pin showed that every p-state automaton (p a prime) containing a cyclic permutation and a non-permutation has a synchronizing word of length at most (p− 1). In this paper we consider permutation automata with the property that adding any non-permutation will lead to a synchronizing word and establish bounds on the lengths of such synchronizing words. In particular, we show that permutation grou...
متن کاملGroups defined by automata
Finite automata have been used effectively in recent years to define infinite groups. The twomain lines of research have as their most representative objects the class of automatic groups (in-cluding word-hyperbolic groups as a particular case) and automata groups (singled out among themore general self-similar groups).The first approach implements in the language of automat...
متن کاملGroups and Semigroups Generated by Automata
In this dissertation we classify the metabelian groups arising from a restricted class of invertible synchronous automata over a binary alphabet. We give faithful, self-similar actions of Heisenberg groups and upper triangular matrix groups. We introduce a new class of semigroups given by a restricted class of asynchronous automata. We call these semigroups " expanding automaton semigroups ". W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Algebra and Computation
سال: 2014
ISSN: 0218-1967,1793-6500
DOI: 10.1142/s0218196714500337