Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Counting powers of words in monoids.

From MaRDI portal
Publication:1024329
Jump to:navigation, search

DOI10.1016/J.EJC.2008.10.005zbMath1187.20064OpenAlexW2002055213MaRDI QIDQ1024329

Zane Kun Li, Stephen P. Humphries

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

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



Uses Software

  • Unnamed Item
  • OEIS



Cites Work

  • COUNTING FUNDAMENTAL PATHS IN CERTAIN GARSIDE SEMIGROUPS
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1024329&oldid=13025134"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 22:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki