Sciweavers

ICGI
2010
Springer
14 years 19 days ago
Inferring Regular Trace Languages from Positive and Negative Samples
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
Antonio Cano Gómez