Related papers: Amenability of Bounded Automata Groups on Infinite…
Given an adaptable separated graph, we construct an associated groupoid and explore its type semigroup. Specifically, we first attach to each adaptable separated graph a corresponding semigroup, which we prove is an $E^*$-unitary inverse…
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its language is the set of all words labelling a path from an…
By the work of Brodzki-Niblo-Nowak-Wright and Monod, topological amenability of a continuous group action can be characterized using uniformly finite homology groups or bounded cohomology groups associated to this action. We show that…
We investigate the language classes recognized by group automata over matrix groups. We present a summary of the results obtained so far together with a number of new results. We look at the computational power of time-bounded group…
A class of additive cellular automata (ACA) on a finite group is defined by an index-group $\m g$ and a finite field $\m F_p$ for a prime modulus $p$ \cite{Bul_arch_1}. This paper deals mainly with ACA on infinite commutative groups and…
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…
Checking whether two pushdown automata with restricted silent actions are weakly bisimilar was shown decidable by S\'enizergues (1998, 2005). We provide the first known complexity upper bound for this famous problem, in the equivalent…
This paper introduces and studies a notion of \emph{algorithmic randomness} for subgroups of rationals. Given a randomly generated additive subgroup $(G,+)$ of rationals, two main questions are addressed: first, what are the model-theoretic…
We describe conditions that characterize amenability for groups in terms of positive definite functions valued in a von Neumann algebra.
We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical…
We make a start on one of George McNulty's Dozen Easy Problems: "Which finite automatic algebras are dualizable?" We give some necessary and some sufficient conditions for dualizability. For example, we prove that a finite automatic algebra…
This paper completely determines the non-amenability of the mapping class groups of infinite-type surfaces, the mapping class groups of locally finite infinite graphs of higher ranks, gives an example of non-amenable stabiliser of a point…
Elder, Kambites, and Ostheimer showed that if the word problem of a finitely generated group $H$ is accepted by a $G$-automaton for an abelian group $G$, then $H$ is virtually abelian. We give a new, elementary, and purely combinatorial…
Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automata, have been successfully used to encode many infinite-state non-regular verification problems. In this paper, we consider a generalization…
In this monograph, we give an account of the relationship between the algebraic structure of finitely generated and countable groups and the regularity with which they act on manifolds. We concentrate on the case of one--dimensional…
We introduce a new method of proving upper estimates of growth of finitely generated groups and constructing groups of intermediate growth using graphs of their actions. These estimates are of the form $\exp(n^\alpha)$ for some $\alpha<1$,…
We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…
Mother groups are the basic building blocks for polynomial automaton groups. We show that, in contrast with mother groups of degree 0 or 1, any bounded, symmetric, generating random walk on the mother groups of degree at least 3 has…
The axioms of iteration theories, or iteration categories, capture the equational properties of fixed point operations in several computationally significant categories. Iteration categories may be axiomatized by the Conway identities and…
By classifying $S$-maximal amenable subgroups of algebraic groups over a global field of characteristic zero, we obtain a complete classification of maximal amenable subgroups up to commensurability in the respective arithmetic groups.…