Related papers: Quasi-automatic groups are asynchronously automati…
A complete deterministic finite automaton in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize completely…
The note contains a few results related to separation axioms and automatic continuity of operations in compact-like semitopological groups. In particular, is presented a semiregular semitopological group $G$ which is not $T_3$. We show that…
We show that an automaton group or semigroup is infinite if and only if it admits an $\omega$-word (i. e. a right-infinite word) with an infinite orbit, which solves an open problem communicated to us by Ievgen V. Bondarenko. In fact, we…
We describe a general technique for embedding certain amalgamated products into direct products. This technique provides us with a way of constructing a host of finitely presented subgroups of automatic groups which are not even…
In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…
Let us consider a linear control system \Sigma on a connected Lie group G. It is known that the accessibility set A from the identity e is in general not a semigroup. In this article we associate a new algebraic object S to \Sigma which…
In this article we provide evidence for a well-known conjecture which states that quasi-isometric simply-connected nilpotent Lie groups are isomorphic. We do so by constructing new examples which are rigid in the sense that whenever they…
Given a $\Gamma$-semigroup $S$, we construct a semigroup $\Sigma$ in such a way that one sided ideals and quasi-ideals of $S$ can be regarded as one sided ideals and quasi-ideals respectively of $\Sigma$. This correspondence and other…
This article focuses on subset reachability in synchronizing automata. First, we provide families of synchronizing automata with subsets which cannot be reached with short words. These families do not fulfil Don's Conjecture about subset…
Let $(X,G)$ be a minimal equicontinuous dynamical system, where $X$ is a compact metric space and $G$ some topological group acting on $X$. Under very mild assumptions, we show that the class of regular almost automorphic extensions of…
A semigroup $S$ is right noetherian if every right congruence on $S$ is finitely generated. In this paper we present some fundamental properties of right noetherian semigroups, discuss how semigroups relate to their substructures with…
We say A is a quasi-normal subgroup of the group G if the commensurator of A in G is all of G. We develop geometric versions of commensurators in finitely generated groups. In particular, g is an element of the commensurator of A in G iff…
A new type of semigroups which appears while dealing with $N=1$ superconformal symmetry in superstring theories is considered. The ideal series having unusual abstract properties is constructed. Various idealisers are introduced and…
For any class $\mathcal{C}$ of bipartite graphs, we define quasi-$\cal C$ to be the class of all graphs $G$ such that every bipartition of $G$ belongs to $\cal C$. This definition is motivated by a generalisation of the switch Markov chain…
We study numerical semigroups with the property "multiplicity= embedding dimension+1", generated by concatenation of arithmetic sequences.
In the classical setting, a convex polytope is said to be semiregular if its facets are regular and its symmetry group is transitive on vertices. This paper studies semiregular abstract polytopes, which have abstract regular facets, still…
We describe in terms of automata theory the automatic actions with post-critically finite limit space. We prove that these actions are precisely the actions by bounded automata and that any self-similar action by bounded automata is…
We give a geometric approach to groups defined by automata via the notion of enriched dual of an inverse transducer. Using this geometric correspondence we first provide some finiteness results, then we consider groups generated by the dual…
We show that for any monoid M, the family of languages accepted by M-automata (or equivalently, generated by regular valence grammars over M) is completely determined by that part of M which lies outside the maximal ideal. Hence, every such…
The binary products of right, left or double division in semigroups that are semilattices of groups give interesting groupoid structures that are in one to one correspondence with semigroups that are semilattices of groups. This work is…