Pages that link to "Item:Q1824703"
From MaRDI portal
The following pages link to Algorithmic problems in varieties of semigroups (Q1824703):
Displaying 23 items.
- Algorithms for \(k\)-meet-semidistributive lattices (Q507534) (← links)
- Residual finiteness in completely regular semigroup varieties (Q581547) (← links)
- On finitely recognizable semigroups (Q811558) (← links)
- Polynomial growth in semigroup varieties. (Q952539) (← links)
- Algorithmic problems for finite groups and finite \(0\)-simple semigroups (Q1358940) (← links)
- On some algorithmic problems related to varieties of nonassociative rings (Q1597968) (← links)
- Algorithmically complex residually finite groups (Q1682244) (← links)
- Concrete algorithms for word problem and subsemigroup problem for semigroups which are disjoint unions of finitely many copies of the free monogenic semigroup (Q1701408) (← links)
- On the algorithmic decidability of the second-type annihilation predicate for varieties of semigroups (Q1759565) (← links)
- On identity bases of epigroup varieties (Q1818860) (← links)
- Semi-invariants, equivariants and algorithms (Q1912703) (← links)
- Algorithmic problems in groups and semigroups. Based on talks given at the international conference, Lincoln, NE, USA, May 11--May 16, 1998 (Q1965379) (← links)
- DLP in semigroups: algorithms and lower bounds (Q2099245) (← links)
- The word problem for relatively free semigroups. (Q2491184) (← links)
- On some algorithmic problems related to varieties of nonassociative rings (Q2713996) (← links)
- Semigroups of RN-algorithms (Q2733985) (← links)
- Minsky Machines and Algorithmic Problems (Q2947180) (← links)
- (Q4275403) (← links)
- (Q4437255) (← links)
- (Q4942273) (← links)
- Algorithms for generalized numerical semigroups (Q5162784) (← links)
- Semialgebraic Proofs and Efficient Algorithm Design (Q5215904) (← links)
- Variety Membership Problem for Two Classes of Non-Finitely Based Semigroups (Q5384349) (← links)
