New decision algorithms for finitely presented commutative semigroups
Publication:1147232
DOI10.1016/0898-1221(81)90115-2zbMath0449.20059OpenAlexW2099954293MaRDI QIDQ1147232
A. M. Ballantyne, Dallas Lankford
Publication date: 1980
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(81)90115-2
decision algorithmsuniform word problemChurch-Rosser term rewriting systemcompletion procedure for commutative associative term rewriting systemsfinitely presented commutative semigroups
Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Artificial intelligence (68T99) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (37)
Cites Work
- New decision algorithms for finitely presented commutative semigroups
- Some algorithmic problems for finitely defined commutative semigroups
- On theories with a combinatorial definition of 'equivalence'
- Constructions in Algebra
- The Isomorphism Problem for Some Classes of Multiplicative Systems
- A Decision Problem for Transformations of Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: New decision algorithms for finitely presented commutative semigroups