1,771 research outputs found

    Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions

    Full text link
    What is the common link, if there is any, between Church-Rosser systems, prefix codes with bounded synchronization delay, and local Rees extensions? The first obvious answer is that each of these notions relates to topics of interest for WORDS: Church-Rosser systems are certain rewriting systems over words, codes are given by sets of words which form a basis of a free submonoid in the free monoid of all words (over a given alphabet) and local Rees extensions provide structural insight into regular languages over words. So, it seems to be a legitimate title for an extended abstract presented at the conference WORDS 2017. However, this work is more ambitious, it outlines some less obvious but much more interesting link between these topics. This link is based on a structure theory of finite monoids with varieties of groups and the concept of local divisors playing a prominent role. Parts of this work appeared in a similar form in conference proceedings where proofs and further material can be found.Comment: Extended abstract of an invited talk given at WORDS 201

    Representation Theory of Finite Semigroups, Semigroup Radicals and Formal Language Theory

    Full text link
    In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are given to obtain many new results, as well as easier proofs of several results in the literature, involving: triangularizability of finite semigroups; which semigroups have (split) basic semigroup algebras, two-sided semidirect product decompositions of finite monoids; unambiguous products of rational languages; products of rational languages with counter; and \v{C}ern\'y's conjecture for an important class of automata

    On Congruence Compact Monoids

    Get PDF
    A universal algebra is called congruence compact if every family of congruence classes with the finite intersection property has a non-empty intersection. This paper determines the structure of all right congruence compact monoids S for which Green’s relations J and H coincide. The results are thus sufficiently general to describe, in particular, all congruence compact commutative monoids and all right congruence compact Clifford inverse monoids

    A large class of sofic monoids

    Full text link
    We prove that a monoid is sofic, in the sense recently introduced by Ceccherini-Silberstein and Coornaert, whenever the J-class of the identity is a sofic group, and the quotients of this group by orbit stabilisers in the rest of the monoid are amenable. In particular, this shows that the following are all sofic: cancellative monoids with amenable group of units; monoids with sofic group of units and finitely many non-units; and monoids with amenable Schutzenberger groups and finitely many L-classes in each D-class. This provides a very wide range of sofic monoids, subsuming most known examples (with the notable exception of locally residually finite monoids). We conclude by discussing some aspects of the definition, and posing some questions for future research

    Sigma theory for Bredon modules

    Full text link
    We develop new invariants similar to the Bieri-Strebel-Neumann-Renz invariants but in the category of Bredon modules (with respect to the class of the finite subgroups of G). We prove that for virtually soluble groups of type FP_{\infty} and finite extension of the Thompson group F the new invariants coincide with the classical ones
    • …
    corecore