Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Alpern, A. J. Demers and F. B. Schneider. Defining Liveness. Information Processing Letters 21, 181–185, 1985.
D. Angluin. On the Complexity of Minimum Inference of Regular Sets. Information and Control 39, 337–350, 1978.
M. Bernard and C. de la Higuera. Apprentissage de Programmes Logiques par Inference Grammaticale, Revue d’Intelligence Artificielle, 14/3–4, 375–396, 2001.
J. R. Büchi. On a decision method in restricted second order arithmetic. Proc. Cong. Logic Method and Philos. Of Sci., Stanford Univ. Press, California, 1960.
M. E. Gold. Complexity of Automaton Identification from Given Data, Information and Control, 37, 302–320, 1978.
C. de la Higuera, J. Oncina and E. Vidal. Identification of dfa’s:data dependant vs dataindependant algorithms,.in Proceedings of ICGI’ 96, LNAI 1147, Springer-Verlag, 1996.
C. de la Higuera. Characteristic Sets for Polynomial Grammatical Inference, Machine Learning 27, 125–138, 1997.
K. Lang, B. A. Pearlmutter and R. A. Price. Results of the Abbadingo One DFA Learning Competition and a New Evidence-Driven State Merging Algorithm, in Grammatical Inference, Proceedings of ICGI’ 98, LNAI 1433, Springer Verlag, 1–12, 1998.
O. Maler and A. Pnueli. On the Learnability of Infinitary Regular Sets, Proc. 4th COLT, 128–136, Morgan Kauffman, San Mateo, 1991.
J. Oncina and P. Garcia. Identifying Regular Languages in Polynomial Time, in Advances in Structural and Syntactic Pattern Recognition, H. Bunke ed., Series in Machine Perception and Artificial Intelligence 5, 99–108, 1992.
R. J. Parekh and V. Honavar. On the relationship between Models for Learning in Helpful Environments, in Proceedings of ICGI 2000, LNAI 1891, Springer Verlag, 207–220, 2000.
A. Saoudi and T. Yokomori. Learning Local and Recognizable ù-languages and Monadic Logic Programs, in Proceedings of EUROCOLT, LNCS, Springer Verlag, 1993.
W. Thomas. Automata on infinite objects, Handbook of Theoretical Computer Science (Van Leewen ed.), 133–191, North-Holland, Amsterdam, 1990.
M. Y. Vardi and P. Wolper. Automata-Theoretic Techniques in Modal Logics of Programs, Journal of Computer and Systems Science 32, 183–221, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de la Higuera, C., Jean-Christophe, J. (2001). Inference of ω-Languages from Prefixes. In: Abe, N., Khardon, R., Zeugmann, T. (eds) Algorithmic Learning Theory. ALT 2001. Lecture Notes in Computer Science(), vol 2225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45583-3_27
Download citation
DOI: https://doi.org/10.1007/3-540-45583-3_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42875-6
Online ISBN: 978-3-540-45583-7
eBook Packages: Springer Book Archive