Pointlike sets: the finest aperiodic cover of a finite semigroup
From MaRDI portal
Publication:1824040
DOI10.1016/0022-4049(88)90042-4zbMath0682.20044MaRDI QIDQ1824040
Publication date: 1988
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-4049(88)90042-4
complexity; finite semigroups; aperiodic semigroups; decidable; Rhodes expansions; finest cover; Presentation Lemma; Zeiger coding
20M05: Free semigroups, generators and relations, word problems
20M30: Representation of semigroups; actions of semigroups on sets
Related Items
The pseudovariety $J$ is hyperdecidable, PSEUDOVARIETY JOINS INVOLVING ${\mathscr J}$ -TRIVIAL SEMIGROUPS, HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS, POINTLIKE SETS, HYPERDECIDABILITY AND THE IDENTITY PROBLEM FOR FINITE SEMIGROUPS, UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS, IDEMPOTENT POINTLIKE SETS, On Pointlike Sets and Joins of Pseudovarieties, ON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPS, INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY, PROFINITE METHODS IN SEMIGROUP THEORY, An effective lower bound for group complexity of finite semigroups and automata, Closures of regular languages for profinite topologies., Prime decomposition theorem for arbitrary semigroups: General holonomy decomposition and synthesis theorem, Product expansions, Subsemigroups and complexity via the presentation lemma, John Rhodes and the theory of finite semigroups., Pointlike sets with respect to R and J., McCammond’s normal forms for free aperiodic semigroups revisited, STABLE PAIRS, A PROFINITE APPROACH TO STABLE PAIRS, APERIODIC POINTLIKES AND BEYOND, On the hyperdecidability of semidirect products of pseudovarieties
Cites Work
