ICGI
2010
Springer
14 years 18 days ago
2010
Springer
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
ICGI
2010
Springer
14 years 18 days 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...
ICGI
2010
Springer
14 years 18 days ago
2010
Springer
This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing wh...
ICGI
2010
Springer
14 years 18 days ago
2010
Springer
