Pages that link to "Item:Q1579152"
From MaRDI portal
The following pages link to Algorithmic problems for amalgams of finite semigroups (Q1579152):
Displaying 14 items.
- Amalgams of free inverse semigroups. (Q677103) (← links)
- Decidability of the word problem in Yamamura's HNN extensions of finite inverse semigroups. (Q958188) (← links)
- Undecidable problems for completely 0-simple semigroups. (Q1025071) (← 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)
- Amalgams of finite inverse semigroups. (Q1772442) (← links)
- Normal forms for semigroup amalgams (Q2357011) (← links)
- Amalgams of inverse semigroups and reversible two-counter machines. (Q2376520) (← links)
- Semigroups of RN-algorithms (Q2733985) (← links)
- Minsky Machines and Algorithmic Problems (Q2947180) (← links)
- Decidability Versus Undecidability of the Word Problem in Amalgams of Inverse Semigroups (Q3449708) (← links)
- Finitely presented nilsemigroups: complexes with the property of uniform ellipticity (Q5033987) (← links)
- On the Universal Theory of Torsion and Lacunary Hyperbolic Groups (Q5189811) (← links)
- ON COMPLETING PARTIAL GROUPOIDS TO SEMIGROUPS (Q5483455) (← links)
- A semigroup of paths on a sequence of uniformly elliptic complexes (Q6148183) (← links)