نتایج جستجو برای: automata groups
تعداد نتایج: 750045 فیلتر نتایج به سال:
We build presentations for automata groups generated by Cayley machines of finite nilpotency class two and prove that these are all cross-wired lamplighter groups.
In this paper, the concepts of somewhat fuzzy automata continuous functions and somewhat fuzzy automata open functions in fuzzy automata topological spaces are introduced and some interesting properties of these functions are studied. In this connection, the concepts of fuzzy automata resolvable spaces and fuzzy automata irresolvable spaces are also introduced and their properties are studied.
We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of rank n; this result, which answers a question of Gilman, is in a very precise sense an abelian analogue of the Muller-Schupp theorem. More generally, if G is ...
We show that several problems which are known to be undecidable for probabilistic automata become decidable for quantum finite automata. Our main tool is an algebraic result of independent interest: we give an algorithm which, given a finite number of invertible matrices, computes the Zariski closure of the group generated by these matrices.
We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability just of a certain explicit family of groups (“Mother groups”) which is done by analyzing the asymptotic properties of random walks on these groups.
We give new examples of FA presentable torsion-free abelian groups. Namely, for every n > 2, we construct a rank n indecomposable torsion-free abelian group which has an FA presentation. We also construct an FA presentation of the group (Z,+) in which every nontrivial cyclic subgroup is not FA recognizable.
We study automata groups generated by reset automata. Every lamplighter group Z/nZ wr Z can be generated by such an automaton, and in general these automata groups are similar in nature to lamplighters: they are amenable locally-finite-by-cyclic groups; under mild decidable conditions, the semigroups generated by such automata are free. Parabolic subgroups and fractal properties are considered.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید