Semigroups, Automata and Languages

Inverse monoids and immersions of cell complexes

In the talk, we study immersions between cell complexes using inverse monoids. By an immersion f : D -> C between cell complexes, we mean a continous map which is a local homeomorphism onto its image, and we further suppose that commutes with the characteristic maps of the cell complexes. We describe immersions between finite-dimensional connected Delta-complexes by replacing the fundamental group of the base space by an appropriate inverse monoid.

Right-angled Artin groups: commensurability classification and subgroup intersection problem.

Two groups are called commensurable if they have isomorphic subgroups of finite index. In the first part of the talk I will discuss our results with Montse Casals-Ruiz and Ilya Kazachkov on the commensurability classification of right-angled Artin groups (RAAGs) defined by trees. In the second part of the talk I will mention some algorithmic properties of RAAGs and discuss our results with Jordi Delgado and Enric Ventura on the subgroup intersection problem for Droms RAAGs.

The image of a representation of pseudowords over the aperiodics.

The pseudowords in a finitely generated free profinite aperiodic semigroup
are faithfully represented by labeled linear orders induced by the factorizations of the pseudowords.

We address the problem of knowing which labeled linear orders are in the image of this representation (This is joint work with Jorge Almeida, José Carlos Costa and Marc Zeitoun).

Nilpotency and strong nilpotency for finite semigroups.

Nilpotent semigroups in the sense of Mal'cev are defined by semigroup identities. Finite nilpotent semigroups constitute a pseudovariety, MN, which has finite rank. The semigroup identities that define nilpotent semigroups, lead us to define strongly Mal'cev nilpotent semigroups. Finite strongly Mal'cev nilpotent semigroups constitute a non-finite rank pseudovariety, SMN. The pseudovariety SMN is strictly contained in the pseudovariety MN but all finite nilpotent groups are in SMN.

Towards a pseudoequational proof theory

A new scheme for proving pseudoidentities from a given set Σ of
pseudoidentities, which is clearly sound, is also shown to be complete
in many instances, such as when Σ defines a locally finite variety, a
pseudovariety of groups or, more generally, of completely simple
semigroups. Many further examples when the scheme is complete are
given when Σ defines a pseudovariety V which is σ-reducible for the
equation x = y, provided Σ is enough to prove a basis of identities
for the variety of σ-algebras generated by V. This gives ample

Semidirect products with the pseudovariety D and tameness.

[This is joint work with Conceição Nogueira and M. Lurdes Teixeira.] The semidirect product is a fundamental operation in the theory of pseudovarieties of semigroups. In turn, the pseudovarieties of the form V*D, where D is the pseudovariety of all finite semigroups whose idempotents are right zeros, are among the most studied semidirect products. The concept of tameness of a pseudovariety was introduced by Almeida and Steinberg as a tool for proving decidability of the membership problem for semidirect products of pseudovarieties.

On the subsemigroup complex of an aperiodic Brandt semigroup

Taking as departure point an article by Cameron, Gadouleau, Mitchell and Peresse on maximal lengths of subsemigroup chains, we introduce the subsemigroup complex H(S) of a finite semigroup S as a (boolean representable) simplicial complex defined through chains in the lattice of subsemigroups of S. The rank of H(S) is the above maximal length minus one and H(S) provides other useful invariants concerning the lattice of subsemigroups of S. We present a research program for such complexes, illustrated through the particular case of combinatorial Brandt semigroups.

Ordered DAG Grammars and Parsing Complexity

Hyperedge Replacement Grammars are a useful and expressive formalism for generating graph languages. Unfortunately, the uniform parsing problem for such grammars is NP-hard. We investigate restrictions which allow polynomial time parsing while still retaining enough expressive power to generate interesting languages. In particular, our search for suitable restrictions is guided by applications in natural language processing.


Subscribe to RSS - Semigroups, Automata and Languages