Information and Computation
Theoretical Computer Science
Combinatorics on traces
Decidability of the Star Problem in A*×b *
Information Processing Letters
New results on the star problem in trace monoids
Information and Computation
Basic notions of universal algebra for language theory and graph grammars
Theoretical Computer Science
Handbook of formal languages, vol. 1
Partial commutation and traces
Handbook of formal languages, vol. 3
Automata, Languages, and Machines
Automata, Languages, and Machines
The Book of Traces
Some Trace Monoids Where Both the Star Problem and the Finite Power Property Problem are Decidable
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
The "Last" Decision Problem for Rational Trace Languages
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Some Undecidability Results related to the Star Problem in Trace Monoids
Some Undecidability Results related to the Star Problem in Trace Monoids
Two Techniques in the Area of the Star Problem
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Two techniques in the area of the star problem in trace monoids
Theoretical Computer Science
| Hi-index | 0.00 |
This paper deals with decision problems related to the star problem in trace monoids, which means to determine whether the iteration of a recognizable trace language is recognizable. Due to a theorem by Richomme from 1994 [18], we know that the star problem is decidable in trace monoids which do not contain a C4-submonoid. It is not known whether the star problem is decidable in C4. In this paper, we show undecidability of some related problems: Assume a trace monoid which contains a C4. Then, it is undecidable whether for two given recognizable languages K and L, we have K ⊆ L*, although we can decide K* ⊆ L. Further, we can not decide recognizability of K ∩ L* as well as universality and recognizability of K ∪ L*.