Semigroups satisfying x m+n = x n

DOI10.1007/3-540-56393-8_23OpenAlexW1526630084MaRDI QIDQ5881194

Nachum Dershowitz

Publication date: 9 March 2023

Published in: Conditional Term Rewriting Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56393-8_23

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42)

Related Items

On the varieties of ai-semirings satisfying \({x^{3}\approx x}\) ⋮ Languages generated by iterated idempotency ⋮ The varieties of semilattice-ordered semigroups satisfying \(x^3\equiv x\) and \(xy\equiv yx\) ⋮ On some varieties of ai-semirings satisfying \(x^{p+1} \approx x\) ⋮ On a variety of Burnside ai-semirings satisfying \(x^n\approx x\) ⋮ Word problem for knotted residuated lattices.

Cites Work

• On regularity of context-free languages
• Systems of reductions
• Thue systems as rewriting systems
• Word problems and a homological finiteness condition for monoids
• A Noetherian and confluent rewrite system for idempotent semigroups
• Classification of noncounting events
• SOLUTION OF THE BURNSIDE PROBLEM FOR EXPONENT 6
• THE SOLUTION TO THE WORD PROBLEM FOR THE RELATIVELY FREE SEMIGROUPS SATISFYING T^a = T^a+b WITH a ≥ 6
• Classifications of periodic words and their application in group theory
• Uniqueness Theorems for Periodic Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Semigroups satisfying x m+n = x n