Computations over finite monoids and their test complexity

Bernd Becker, Uwe Sparmann. Computations over finite monoids and their test complexity. In Proceedings of the Nineteenth International Symposium on Fault-Tolerant Computing, FTCS 1989, Chicago, IL, USA, 21-23 June, 1989. pages 299-306, IEEE Computer Society, 1989. [doi]

@inproceedings{BeckerS89,
  title = {Computations over finite monoids and their test complexity},
  author = {Bernd Becker and Uwe Sparmann},
  year = {1989},
  doi = {10.1109/FTCS.1989.105583},
  url = {http://dx.doi.org/10.1109/FTCS.1989.105583},
  researchr = {https://researchr.org/publication/BeckerS89},
  cites = {0},
  citedby = {0},
  pages = {299-306},
  booktitle = {Proceedings of the Nineteenth International Symposium on Fault-Tolerant Computing, FTCS 1989, Chicago, IL, USA, 21-23 June, 1989},
  publisher = {IEEE Computer Society},
  isbn = {0-8186-1959-7},
}