THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM

2005 ◽  
Vol 15 (02) ◽  
pp. 317-326 ◽  
Author(s):  
STEVE SEIF
Keyword(s):  
Finite Semigroup ◽  
Equivalence Problem ◽  
Rees Matrix Semigroups ◽  
Term Equivalence ◽  
Finite Semigroups ◽  
Finite Word ◽  
Np Complete ◽  
Equivalence Problems ◽  
Matrix Semigroups

A semigroup term is a finite word in the alphabet x1, x2,…. The length of a term p, denoted by |p|, is the number of variables in p, including multiplicities. The term-equivalence problem for a finite semigroup S has as an instance a pair of terms {p,q} with size |p| + |q| and asks whether p ≈ q is an identity over S. It is proved here that [Formula: see text], the six-element Perkins semigroup, has co-NP-complete term-equivalence problem, a result which leads to the completion of the classification of he term-equivalence problems for monoid extensions of aperiodic Rees matrix semigroups. From the main result it follows that there exist finite semigroups with tractable term-equivalence problems but having subsemigroups and homomorphic images with co-NP-complete term-equivalence problems.

scholarly journals ON SEMIGROUPS WITH PSPACE-COMPLETE SUBPOWER MEMBERSHIP PROBLEM

2018 ◽  
Vol 106 (1) ◽  
pp. 127-142
Author(s):  
MARKUS STEINDL
Keyword(s):  
Finite Semigroup ◽  
Transformation Semigroup ◽  
Membership Problem ◽  
Direct Power ◽  
Full Transformation ◽  
Rees Matrix Semigroups ◽  
Full Transformation Semigroup ◽  
Np Complete ◽  
Matrix Semigroups

Fix a finite semigroup $S$ and let $a_{1},\ldots ,a_{k},b$ be tuples in a direct power $S^{n}$. The subpower membership problem (SMP) for $S$ asks whether $b$ can be generated by $a_{1},\ldots ,a_{k}$. For combinatorial Rees matrix semigroups we establish a dichotomy result: if the corresponding matrix is of a certain form, then the SMP is in P; otherwise it is NP-complete. For combinatorial Rees matrix semigroups with adjoined identity, we obtain a trichotomy: the SMP is either in P, NP-complete, or PSPACE-complete. This result yields various semigroups with PSPACE-complete SMP including the six-element Brandt monoid, the full transformation semigroup on three or more letters, and semigroups of all $n$ by $n$ matrices over a field for $n\geq 2$.

scholarly journals COMPLETELY REGULAR MONOIDS WITH TWO GENERATORS

2011 ◽  
Vol 90 (2) ◽  
pp. 271-287 ◽  
Author(s):  
MARIO PETRICH
Keyword(s):  
Infinite Number ◽  
Free Semigroup ◽  
Regular Semigroups ◽  
Completely Regular ◽  
Rees Matrix Semigroups ◽  
Completely Regular Semigroups ◽  
Special Case ◽  
Matrix Semigroups ◽  
Translational Hulls

AbstractWe classify semigroups in the title according to whether they have a finite or an infinite number ofℒ-classes or ℛ-classes. For each case, we provide a concrete construction using Rees matrix semigroups and their translational hulls. An appropriate relatively free semigroup is used to complete the classification. All this is achieved by first treating the special case in which one of the generators is idempotent. We conclude by a discussion of a possible classification of 2-generator completely regular semigroups.

scholarly journals Restrictive Acceptance Suffices for Equivalence Problems

2000 ◽  
Vol 3 ◽  
pp. 86-95 ◽  
Author(s):  
Bernd Borchert ◽  
Lane A. Hemaspaandra ◽  
Jörg Rothe
Keyword(s):  
Upper Bound ◽  
Equivalence Problem ◽  
Decision Diagrams ◽  
Ordered Binary Decision Diagrams ◽  
Binary Decision ◽  
Strength Of Evidence ◽  
Np Complete ◽  
Np Problems ◽  
Np Problem ◽  
Equivalence Problems

AbstractOne way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence but more broadly applicable—for suggesting that concrete NP problems are not NP-complete. In particular, we introduce the promise class EP, the subclass of NP consisting of those languages accepted by NP machines that, when they accept, always have a number of accepting paths that is a power of two. We show that FewP, bounded ambiguity polynomial time (which contains UP), is contained in EP. The class EP applies as an upper bound to some concrete problems to which previous approaches have never been successful, for example the negation equivalence problem for OBDDs (ordered binary decision diagrams).

scholarly journals A Complete Classification of Tractability in RCC-5

1997 ◽  
Vol 6 ◽  
pp. 211-221 ◽  
Author(s):  
T. Drakengren ◽  
P. Jonsson
Keyword(s):  
Spatial Reasoning ◽  
Complete Classification ◽  
Satisfiability Problem ◽  
Restricted Version ◽  
Np Complete ◽  
Computational Properties

We investigate the computational properties of the spatial algebra RCC-5 which is a restricted version of the RCC framework for spatial reasoning. The satisfiability problem for RCC-5 is known to be NP-complete but not much is known about its approximately four billion subclasses. We provide a complete classification of satisfiability for all these subclasses into polynomial and NP-complete respectively. In the process, we identify all maximal tractable subalgebras which are four in total.

Undecidability of the identity problem for finite semigroups

1992 ◽  
Vol 57 (1) ◽  
pp. 179-192 ◽  
Author(s):  
Douglas Albert ◽  
Robert Baldinger ◽  
John Rhodes
Keyword(s):  
Word Problem ◽  
Finite Semigroup ◽  
Identity Problem ◽  
Finite Semigroups ◽  
Or Groups ◽  
Finite Set ◽  
Variety Of Semigroups ◽  
Finite Products

In 1947 E. Post [28] and A. A. Markov [18] independently proved the undecidability of the word problem (or the problem of deducibility of relations) for semigroups. In 1968 V. L. Murskil [23] proved the undecidability of the identity problem (or the problem of deducibility of identities) in semigroups.If we slightly generalize the statement of these results we can state many related results in the literature and state our new results proved here. Let V denote either a (Birkhoff) variety of semigroups or groups or a pseudovariety of finite semigroups. By a very well-known theorem a (Birkhoff) variety is defined by equations or equivalently closed under substructure, surmorphisms and all products; see [7]. It is also well known that V is a pseudovariety of finite semigroups iff V is closed under substructure, surmorphism and finite products, or, equivalently, determined eventually by equations w1 = w1′, w2 = w2′, w3 = w3′,… (where the finite semigroup S eventually satisfies these equations iff there exists an n, depending on S, such that S satisfies Wj = Wj′ for j ≥ n). See [8] and [29]. All semigroups form a variety while all finite semigroups form a pseudovariety.We now consider a table (see the next page). In it, for example, the box denoting the “word” (identity) problem for the psuedovariety V” means, given a finite set of relations (identities) E and a relation (identity) u = ν, the problem of whether it is decidable that E implies u = ν inside V.

scholarly journals On bisimple semigroups generated by a finite number of idempotents

1982 ◽  
Vol 33 (1) ◽  
pp. 92-101 ◽  
Author(s):  
Karl Byleen
Keyword(s):  
Finite Number ◽  
Partial Order ◽  
Natural Partial Order ◽  
Rees Matrix Semigroups ◽  
Matrix Semigroups ◽  
Completely Simple

AbstractNon-completely simple bisimple semigroups S which are generated by a finite number of idempotents are studied by means of Rees matrix semigroups over local submonoids eSe, e = e2 ∈ S. If under the natural partial order on the set Es of idempotents of such a semigroup S the sets ω(e) = {ƒ ∈ Es: ƒ ≤ e} for each e ∈ Es are well-ordered, then S is shown to contain a subsemigroup isomorphic to Sp4, the fundamental four-spiral semigroup. A non-completely simple hisimple semigroup is constructed which is generated by 5 idempotents but which does not contain a subsemigroup isomorphic to Sp4.

scholarly journals Generators and relations of Rees matrix semigroups

1999 ◽  
Vol 42 (3) ◽  
pp. 481-495 ◽  
Author(s):  
H. Ayik ◽  
N. Ruškuc
Keyword(s):  
Rees Matrix Semigroup ◽  
Finitely Generated ◽  
Finite Generation ◽  
Generators And Relations ◽  
Rees Matrix Semigroups ◽  
Finite Presentability ◽  
Matrix Semigroup ◽  
Finitely Presented ◽  
Matrix Semigroups ◽  
The Ideal

In this paper we consider finite generation and finite presentability of Rees matrix semigroups (with or without zero) over arbitrary semigroups. The main result states that a Rees matrix semigroup M[S; I, J; P] is finitely generated (respectively, finitely presented) if and only if S is finitely generated (respectively, finitely presented), and the sets I, J and S\U are finite, where U is the ideal of S generated by the entries of P.

Certain rees matrix semigroups with universal properties

1981 ◽  
Vol 22 (1) ◽  
pp. 101-118 ◽  
Author(s):  
Mario Petrich ◽  
Norman R. Reilly
Keyword(s):  
Rees Matrix Semigroups ◽  
Universal Properties ◽  
Matrix Semigroups
Sign in / Sign up

Export Citation Format

Share Document