Name
Abstract | ||
|---|---|---|
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 subset of S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of the following two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoids. In 1991, Klarner, Birget and Satterfield proved the undecidability of the freeness problem over three-by-three integer matrices. Both results led to the publication of many subsequent papers. The aim of the present paper is (i) to present general results about freeness problems, (ii) to study the decidability of freeness problems over various particular semigroups (special attention is devoted to multiplicative matrix semigroups), and (iii) to propose precise, challenging open questions in order to promote the study of the topic. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1051/ita/2012010 | RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS |
Keywords | DocType | Volume |
Decidability,semigroup freeness,matrix semigroups,Post correspondence problem | Journal | 46 |
Issue | ISSN | Citations |
3 | 0988-3754 | 9 |
PageRank | References | Authors |
1.04 | 22 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Julien Cassaigne | 1 | 282 | 40.80 |
| François Nicolas | 2 | 9 | 1.04 |