"Certifying the Decidability of the Word Problem in Monoids at Large."

Reinis Cirpons et al. (2026)

> Home

Details and statistics

DOI: 10.1145/3779031.3779101

access: closed

type: Conference or Workshop Paper

metadata version: 2026-01-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cpp/CirponsHMMMS26
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cpp/CirponsHMMMS26
Reinis Cirpons, Florent Hivert, Assia Mahboubi, Guillaume Melquiond, James D. Mitchell, Finn Smith:
Certifying the Decidability of the Word Problem in Monoids at Large. CPP 2026: 128-142

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.