Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
On the learnability of infinitary regular sets
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Handbook of theoretical computer science (vol. B)
Learning local and recognizable &ohgr;-languages and monadic logic programs
Euro-COLT '93 Proceedings of the first European conference on Computational learning theory
Characteristic Sets for Polynomial Grammatical Inference
Machine Learning
ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
On the Relationship between Models for Learning in Helpful Environments
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Identification of DFA: data-dependent vs data-independent algorithms
ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
Learning of Regular Bi-omega Languages
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Learning figures with the hausdorff metric by fractals
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
| Hi-index | 0.00 |
B眉chi automata are used to recognize languages of infinite words. Such languages have been introduced to describe the behavior of real time systems or infinite games. The question of inferring them from infinite examples has already been studied, but it may seem more reasonable to believe that the data from which we want to learn is a set of finite words, namely the prefixes of accepted or rejected infinite words. We describe the problems of identification in the limit and polynomial identification in the limit from given data associated to different interpretations of these prefixes: a positive prefix is universal (respectively existential) when all the infinite words of which it is a prefix are in the language (respectively when at least one is) ; the same applies to the negative prefixes. We prove that the classes of regular ?-languages (those recognized by B眉chi automata) and of deterministic ?-languages (those recognized by deterministic B眉chi automata) are not identifiable in the limit, whichever interpretation for the prefixes is taken. We give a polynomial algorithm that identifies the class of safe languages from positive existential prefixes and negative universal prefixes. We show that this class is maximal for polynomial identification in the limit from given data, in the sense that no superclass can even be identified in the limit.