A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The Star Problem and the Finite Power Property in Trace Monoids: Reductions beyond C4
2002
Information and Computation
We deal with the star problem in trace monoids which means to decide whether the iteration of a recognizable trace language is recognizable. We consider trace monoids K n = {a 1 , b 1 } * × · · · × {a n , b n } * . Our main result asserts that the star problem is decidable in some trace monoid M iff it is decidable in the biggest K n submonoid in M. Consequently, future research on the star problem can focus on the trace monoids K n . We develop the main results of the paper for the finit power
doi:10.1006/inco.2002.3152
fatcat:5dyguoonzbexnnsu6iukrvxnda