Information and Computation
Mixed product and asynchronous automata
Theoretical Computer Science
Decidability of the Star Problem in A*×b *
Information Processing Letters
Synthesis of nondeterministic asynchronous automata
Semantics of programming languages and model theory
New results on the star problem in trace monoids
Information and Computation
Partial commutation and traces
Handbook of formal languages, vol. 3
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
A Connection between the Star Problem and the Finite Power Property in Trace Monoids
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Star Problem in Trace Monoids: Reductions Beyond C4
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The "Last" Decision Problem for Rational Trace Languages
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Limited subsets of a free monoid
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
The Star Problem in Trace Monoids: Reductions Beyond C4
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
| Hi-index | 0.00 |
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 Kn = {a1, b1}ċ ×... × {an, bn}ċ. Our main theorem asserts that the star problem is decidable in a trace monoid M iff it is decidable in the biggest Kn submonoid in M. Thus, future research on the star problem can focus on the trace monoids Kn. The recently shown decidability equivalence between the star problem and the finite power problem [14] plays a crucial role in the paper.