Automatic presentations for semigroups

Special Issue: 2nd International Conference on Language and Automata Theory and Applications (LATA 2008)This paper applies the concept of FA-presentable structures to semigroups. We give a complete classification of the finitely generated FA-presentable cancellative semigroups: namely, a finitely generated cancellative semigroup is FA-presentable if and only if it is a subsemigroup of a virtually abelian group. We prove that all finitely generated commutative semigroups are FA-presentable. We give a complete list of FA-presentable one-relation semigroups and compare the classes of FA-presentable semigroups and automatic semigroups. (C) 2009 Elsevier Inc. All rights reserved.PostprintPeer reviewe

Unary enhancements of inherently nonfinitely based semigroups

We exhibit a simple condition under which a finite involutary semigroup whose semigroup reduct is inherently nonfinitely based is also inherently nonfinitely based as a unary semigroup. As applications, we get already known as well as new examples of inherently nonfinitely based involutory semigroups. We also show that for finite regular semigroups, our condition is not only sufficient but also necessary for the property of being inherently nonfinitely based to persist. This leads to an algorithmic description of regular inherently nonfinitely based involutory semigroups.Comment: 11 pages, 1 figure. Section 4 has been improved and expanded according to suggestions of an anonymous referee of the journal version. A few minor improvements have been done in Section

Affine convex body semigroups

In this paper we present a new kind of semigroups called convex body semigroups which are generated by convex bodies of R^k. They generalize to arbitrary dimension the concept of proportionally modular numerical semigroup of [7]. Several properties of these semigroups are proven. Affine convex body semigroups obtained from circles and polygons of R^2 are characterized. The algorithms for computing minimal system of generators of these semigroups are given. We provide the implementation of some of them

Automatic structures for semigroup constructions

We survey results concerning automatic structures for semigroup constructions, providing references and describing the corresponding automatic structures. The constructions we consider are: free products, direct products, Rees matrix semigroups, Bruck-Reilly extensions and wreath products.Comment: 22 page

Groups and Semigroups Defined by Colorings of Synchronizing Automata

In this paper we combine the algebraic properties of Mealy machines generating self-similar groups and the combinatorial properties of the corresponding deterministic finite automata (DFA). In particular, we relate bounded automata to finitely generated synchronizing automata and characterize finite automata groups in terms of nilpotency of the corresponding DFA. Moreover, we present a decidable sufficient condition to have free semigroups in an automaton group. A series of examples and applications is widely discussed, in particular we show a way to color the De Bruijn automata into Mealy automata whose associated semigroups are free, and we present some structural results related to the associated groups