相关论文: Post-critically finite self-similar groups

We define two complexes on which the group Aut$(F_n)$ acts freely. The homotopy groups of these are studied. They map to the K-groups of Z and are themselves a sort of pre-K-theory.

A stochastic timed automaton is a purely stochastic process defined on a timed automaton, in which both delays and discrete choices are made randomly. We study the almost-sure model-checking problem for this model, that is, given a…

A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e.…

The aim of this paper is to investigate whether the class of automaton semigroups is closed under certain semigroup constructions. We prove that the free product of two automaton semigroups that contain left identities is again an automaton…

We use the description of the Schutzenberger automata for amalgams of finite inverse semigroups given by Cherubini, Meakin, Piochi to obtain structural results for such amalgams. Schutzenberger automata, in the case of amalgams of finite…

We study structural restrictions on biautomata such as, e.g., acyclicity, permutation-freeness, strongly permutation-freeness, and orderability, to mention a few. We compare the obtained language families with those induced by deterministic…

We introduce a logic to express structural properties of automata with string inputs and, possibly, outputs in some monoid. In this logic, the set of predicates talking about the output values is parametric, and we provide sufficient…

We show that if G is an infinitely generated locally (polycyclic-by-finite) group with cohomology almost everywhere finitary, then every finite subgroup of G acts freely and orthogonally on some sphere.

Saturation is a fundamental game-semantic property satisfied by strategies that interpret higher-order concurrent programs. It states that the strategy must be closed under certain rearrangements of moves, and corresponds to the intuition…

Suitable extensions of the monadic second-order theory of k successors have been proposed in the literature to capture the notion of time granularity. In this paper, we provide the monadic second-order theories of downward unbounded layered…

We show that every finite group occurs as the automorphism group of infinitely many finite (field) extensions of any given Hilbertian field. This extends and unifies previous results of M. Fried and Takahashi on the global field case.

In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…

Every finitely generated self-similar group naturally produces an infinite sequence of finite $d$-regular graphs $\Gamma_n$. We construct self-similar groups, whose graphs $\Gamma_n$ can be represented as an iterated zig-zag product and…

We classify finite groups that can act by automorphisms and birational automorphisms on non-trivial Severi-Brauer surfaces over fields of characteristic zero.

We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order…

Traditionally, finite automata theory has been used as a framework for the representation of possibly infinite sets of strings. In this work, we introduce the notion of second-order finite automata, a formalism that combines finite automata…

A study of assisted problem solving formalized via decompositions of deterministic finite automata is initiated. The landscape of new types of decompositions of finite automata this study uncovered is presented. Languages with various…

We define and develop the notion of a discretisable quasi-action. It is shown that a cobounded quasi-action on a proper non-elementary hyperbolic space $X$ not fixing a point of $\partial X$ is quasi-conjugate to an isometric action on…

This note is a continuation of the study of the relationship between the geometry of Cayley graphs and the size of its metric-functional boundary. We show that, if there exists a Cayley graph with finitely many Busemann points, then the…

We introduce the notion of hyperfiniteness for permutation actions of countable groups on countable sets and give a geometric and analytic characterization, similar to the known characterizations for amenable actions. We also answer a…