On the decidability of semigroup freeness

@article{Cassaigne2012OnTD,
  title={On the decidability of semigroup freeness},
  author={Julien Cassaigne and François Nicolas},
  journal={RAIRO - Theor. Inf. and Applic.},
  year={2012},
  volume={46},
  pages={355-399}
}
This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoid. In 1991, Klarner, Birget and Satterfield proved the undecidability of the… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 44 references

Autour de quelques problèmes de décidabilité sur des semigroupes de matrices

  • F. Mazoit
  • Unpublished,
  • 1998
Highly Influential
3 Excerpts

Sur l’équation diophantienne xyz2 = t2(xy− x− y− 1)

  • L. Guyot
  • Manuscript,
  • 2008
1 Excerpt

Similar Papers

Loading similar papers…