Enumerating words in finitely presented monoids

MaRDI QIDQ2783477zbMATH OpenFDO

Authors Miguel Angel Borges-Trenard, Hebert Pérez-Rosés

Publication date 21 April 2002

Published in Revista Investigación Operacional (Search for Journal in Brave)

zbMATH Keywords

coset enumerationfinitely presented groupsfinitely presented monoidsorders

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42) Combinatorics on words (68R15)

Recommendations

• Characterizing the normal forms of a finitely presented monoid
• scientific article; zbMATH DE number 3889793
• Double coset enumeration
• An explicit algorithm for normal forms in small overlap monoids
• Automatic Groups Associated with Word Orders Other than Shortlex

Cited in

(4)

• The monadic theory of finite representations of infinite words
• Characterizing the normal forms of a finitely presented monoid
• Finite Monoids: From Word to Circuit Evaluation
• On finite monoids over nonnegative integer matrices and short killing words

This page was built for publication: Enumerating words in finitely presented monoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2783477)