The star problem and the finite power property in trace monoids: reductions beyond C4
Information and Computation
The Star Problem in Trace Monoids: Reductions Beyond C4
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Time-stamps for Mazurkiewicz traces
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Distributed Asynchronous Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Compositional synthesis of asynchronous automata
Theoretical Computer Science
Unfolding synthesis of asynchronous automata
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Hi-index | 0.00 |