ICGI
2010
Springer
13 years 5 months ago
2010
Springer
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...