Counting powers of words in monoids.

DOI10.1016/J.EJC.2008.10.005zbMATH Open1187.20064OpenAlexW2002055213MaRDI QIDQ1024329FDOQ1024329

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

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

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)

Cites Work

• The On-Line Encyclopedia of Integer Sequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• COUNTING FUNDAMENTAL PATHS IN CERTAIN GARSIDE SEMIGROUPS

Cited In (3)

• Title not available (Why is that?)
• Power sums associated with certain recursive procedures on words
• The next step of the word problem over monoids.

Uses Software

• Magma
• OEIS

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)