Some algorithmic problems for finitely defined commutative semigroups

DOI10.1007/BF02196421zbMath0223.20064MaRDI QIDQ2547964

A. P. Biryukov

Publication date: 1968

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Mathematics Subject Classification ID

Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05)

Related Items

The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups ⋮ The Most General Conservation Law for a Cellular Automaton ⋮ New decision algorithms for finitely presented commutative semigroups ⋮ On the hierarchy of conservation laws in a cellular automaton ⋮ Finite groups ⋮ Presentations of groups and monoids ⋮ The complexity of the word problems for commutative semigroups and polynomial ideals ⋮ Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups. ⋮ Properties of congruences on commutative monoids ⋮ Complexity of the word problem for commutative semigroups of fixed dimension

Cites Work

• Unnamed Item