Two techniques in the area of the star problem in trace monoids
Theoretical Computer Science
Some undecidability results related to the star problem in trace monoids
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Efficient recognition of trace languages defined by repeat-until loops
Information and Computation
The kleene equality for graphs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 5.23 |