Testing membership: Beyond permutation groups

DOI10.1007/BFb0029001zbMath1492.68059OpenAlexW126708816MaRDI QIDQ5096172

Martin Beaudry, Denis Thérien, Pierre McKenzie

Publication date: 16 August 2022

Published in: STACS 89 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0029001

zbMATH Keywords

membership problemfinite monoidsabelian monoidsidempotent semigroups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05)

Related Items (1)

Characterization of idempotent transformation monoids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complete problems for deterministic polynomial time
• The lattice of equational classes of idempotent semigroups
• All varieties of bands
• A taxonomy of problems with fast parallel algorithms
• Complexity of some problems from the theory of automata
• The Parallel Complexity of Abelian Permutation Group Problems
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• All Varieties of Bands I
• The complexity of theorem-proving procedures

This page was built for publication: Testing membership: Beyond permutation groups