DMCA
TECHNISCHE UNIVERSIT AT DRESDEN Fakult at Informatik
BibTeX
@MISC{Kirsten_technischeuniversit,
author = {D. Kirsten and G. Richomme and Fakult At Informatik and Technische Berichte Issn},
title = {TECHNISCHE UNIVERSIT AT DRESDEN Fakult at Informatik},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In the last decade, some researches on the star problem in trace monoids (is the iteration of a recognizable language also recognizable?) has pointed out the interest of the finite power property to achieve partial solutions of this problem. We prove that the star problem is decidable in some trace monoid if and only if in the same monoid, it is decidable whether a recognizable language has the finite power property. Intermediary results allow us to give a shorter proof for the decidability of the two previous problems in every trace monoid without C4-submonoid. We also deal with some earlier ideas, conjectures, and questions which have been raised in the research on the star problem and the finite power property, e.g., we show the decidability of these problems for recognizable languages which contain at most one non-connected trace. This article is published as Technical Report both at the Department of Computer Science at Dresden University of Technology and at the Laboratoire de ...
