A connection between the star problem and the finite power property in trace monoids. (Extended abstract) (Q4938641)

Trace monoids are studied. An alphabet \(\Sigma\) and a symmetric relation \(I\) on it are given. On the free monoid \(\Sigma^*\) the congruence \(\approx_1\) is induced by \(ab\approx_1 ba\) for each pair \(a,b\) of \(\Sigma\) with \(aIb\). The factor of \(\Sigma^*\) by \(\approx_1\) is a trace monoid. A subset of a trace monoid is a trace language. The star problem is the problem, whether the language \(L^*\) for a recognizable (by an automaton) trace language \(L\) is recognizable. The finite power property problem is the problem, whether for a given recognizable language \(L\) there is a non-negative integer \(n\) such that \(L^*=\bigcup_{i=0}^n L^i\). Connections between these problems are studied. For the entire collection see [Zbl 0917.00014].