The finiteness of finitely presented monoids

DOI10.1016/S0304-3975(98)00038-3zbMath1021.68054OpenAlexW2088352872MaRDI QIDQ1275467

Robert McNaughton

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00038-3

zbMATH Keywords

multiplication tablesfinite monoidsfinitely presented monoidsThue systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Cites Work

• The Knuth-Bendix Completion Procedure and Thue Systems
• A practical method for enumerating cosets of a finite abstract group
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The finiteness of finitely presented monoids