相关论文: Post-critically finite self-similar groups
We construct finite group actions on Lagrangian Floer theory when symplectic manifolds have finite group actions and Lagrangian submanifolds have induced group actions. We first define finite group actions on Novikov-Morse theory. We…
We prove that for any countable group acting virtually specially on a CAT(0) cube complex, the orbit equivalence relation induced by its action on the Roller boundary is hyperfinite. This can be considered as a generalization of…
Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…
We introduced a family of infinite graphs directly associated with a class of von Neumann automaton model A_{G}. These are finite state models used in symbolic dynamics: stimuli models and in control theory. In the context of groupoid von…
Reaction systems are a formal model that has been introduced to investigate the interactive behaviors of biochemical reactions. Based on the formal framework of reaction systems, we propose new computing models called reaction automata that…
There are several natural families of groups acting on rooted trees for which every member is known to be amenable. It is, however, unclear what the elementary amenable members of these families look like. Towards clarifying this situation,…
A new technique is presented to prove non-termination of term rewriting. The basic idea is to find a non-empty regular language of terms that is closed under rewriting and does not contain normal forms. It is automated by representing the…
We introduce notions of continuous orbit equivalence and strong (respective, weak) continuous orbit equivalence for automorphism systems of \'{e}tale equivalence relations, and characterize them in terms of the semi-direct product…
Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic. By restricting…
We introduce classical and non-deterministic finite automata associated with representations of the braid group. After briefly reviewing basic definitions on finite automata, Coxeter's groups and the associated word problem, we turn to the…
In this article we construct asynchronous and sometimes synchronous automatic structures for amalgamated products and HNN extensions of groups that are strongly asynchronously (or synchronously) coset automatic with respect to the…
For a continuous action $G\curvearrowright X$ of a countable group on a compact metrizable space we show that the following are equivalent: (i) the action $G\curvearrowright X$ has the small boundary property and no finite orbits, (ii) for…
We complete the initial study of jumping finite automata, which was started in a former article of Meduna and Zemek \citep{athMED1}. The open questions about basic closure properties are solved. Besides this, we correct erroneous results…
In the paper we develop the $p$-adic theory of discrete automata. Every automaton $\mathfrak A$ (transducer) whose input/output alphabets consist of $p$ symbols can be associated to a continuous (in fact, 1-Lipschitz) map from $p$-adic…
We introduce a new tool, called the orbit automaton, that describes the action of an automaton group $G$ on the subtrees corresponding to the orbits of $G$ on levels of the tree. The connection between $G$ and the groups generated by the…
We show that tree almost automorphism groups, including Neretin groups, satisfy the analogue of the $F_\infty$-finiteness condition in the world of totally disconnected groups: They possess a cellular action on a contractible cellular…
This paper grew out of three tutorial lectures on automatic structures given by the first author at the Logic Colloquium 2007. We discuss variants of automatic structures related to several models of computation: word automata, tree…
We study the realization problem of finite groups as the group of homotopy classes of self-homotopy equivalences of finite spaces. Let $G$ be a finite group. Using an infinite family of pairwise non weakly homotopic asymmetric spaces we…
We study the conjugacy problem in the automorphism group $Aut(T)$ of a regular rooted tree $T$ and in its subgroup $FAut(T)$ of finite-state automorphisms. We show that under the contracting condition and the finiteness of what we call the…
Using the semigroup approach to abstract boundary control problems we characterize the space of all exactly reachable states. Moreover, we study the situation when the controls of the system are required to be positive. The abstract results…