ENUMERATING WORDS IN FINITELY PRESENTED MONOIDS

Authors

  • Miguel A. Borges-Trenard Department of Mathematics, Faculty of Sciences, University of Oriente
  • Hebert Pérez-Rosés Department of Mathematics, Faculty of Sciences, University of Oriente

Keywords:

Graphs, efficient algorithm

Abstract

An efficient algorithm is given, to compute the order of a finitely presented group or monoid by enumerating all the elements in a suitable sequence, so as to save space. It is shown that only one element of the group or monoid needs to be kept in memory at each iteration.

Downloads

Download data is not yet available.

Downloads

Published

2023-06-27

How to Cite

Borges-Trenard, M. A., & Pérez-Rosés, H. (2023). ENUMERATING WORDS IN FINITELY PRESENTED MONOIDS. Investigación Operacional, 22(1). Retrieved from https://revistas.uh.cu/invoperacional/article/view/7047

Issue

Vol. 22 No. 1 (2001): Investigacion Operacional

Section

Articles

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Similar Articles

1 2 3 4 5 6 7 8 9 10 > >> 

You may also start an advanced similarity search for this article.