VOLUME 7 2002 NUMBER 2
The Computing Power of Programs over Finite Monoids
Pascal Tesson, Denis Thérien
Pages 247–258



Download Abstract
 Fulltext is accessible with your personal account
 ShowHide BibTeX
BibTeX: 
@article{JALC-2002-247,
  author  = {Pascal Tesson and Denis Th{\'{e}}rien},
  title   = {The Computing Power of Programs over Finite Monoids},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {7},
  number  = {2},
  pages   = {247--258},
  year    = {2002},
  url     = {https://doi.org/10.25596/jalc-2002-247},
  doi     = {10.25596/jalc-2002-247}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: programs over monoids, nilpotent groups, unambiguous concatenation, wreath product
DOI: 10.25596/jalc-2002-247