Counting powers of words in monoids.

DOI10.1016/J.EJC.2008.10.005MaRDI QIDQ1024329zbMATH OpenOpenAlexFDO

Authors Stephen P. Humphries, Zane Kun Li

Publication date 17 June 2009

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2008.10.005

zbMATH Keywords

Cayley graphscombinatorial problemsmonoidspowers of words

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05)

Recommendations

• The Number of Words of Length n in a Graph Monoid
• scientific article; zbMATH DE number 3956458
• On noncounting regular classes
• Positive theories of free monoids
• DISTRIBUTION OF PRODUCTS IN FINITE MONOIDS I: COMBINATORICS

Cites work

• scientific article; zbMATH DE number 53661 (Why is no real title available?)
• scientific article; zbMATH DE number 3466240 (Why is no real title available?)
• COUNTING FUNDAMENTAL PATHS IN CERTAIN GARSIDE SEMIGROUPS
• The On-Line Encyclopedia of Integer Sequences

Cited in

(3)

• scientific article; zbMATH DE number 2196238 (Why is no real title available?)
• Power sums associated with certain recursive procedures on words
• The next step of the word problem over monoids.

Describes a project that uses

Uses Software

• OEIS
• Magma

This page was built for publication: Counting powers of words in monoids.

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