Abstract
Angluin defined in [Ang82] the classes of k-reversible regular languages and showed that these classes are identifiable in the limit from positive data. We introduced in [DLT01b] a class of automata based on properties of residual languages (RFSA) and showed in [DLT00] and [DLT01a] that this class could be interesting for grammatical inference purpose. Here, we study properties of 0-reversible languages that can be expressed as properties of their residual languages and that are useful for identification from positive data. This leads us to define classes of languages which strictly contain the class of 0-reversible languages and are identifiable in the limit from positive data.
This is a preview of subscription content, log in via an institution to check access.
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
D. Angluin. Inductive inference of formal languages from positive data. Inform. Control, 45(2):117–135, May 1980.
D. Angluin. Inference of reversible languages. J. ACM, 1982.
M. Blum and L. Blum. Towards a mathematical theory of inductive inference. Information and Control, 28:125–155, 1975.
F. Denis, A. Lemay, and A. Terlutte. Learning regular languages using non deterministic finite automata. In ICGI’2000, 5th International Colloquium on Grammatical Inference, volume 1891 of LNAI, pages 39–50. Springer Verlag, 2000.
F. Denis, A. Lemay, and A. Terlutte. Learning regular languages using RFSA. In Springer-Verlag, editor, Proceedings of the 12th International Conference on Algorithmic Learning Theory (ALT-01), 2001.
F. Denis, A. Lemay, and A. Terlutte. Residual finite state automata. In STACS 2001, volume 2010 of LNCS, pages p. 144–157. Springer Verlag, 2001.
H. Fernau. Learning of terminal distinguishable languages. In Proc. AMAI 2000, 2000.
Henning Fernau. Identification of function distinguishable languages. In 11th International Conference on Algorithmic Learning Theory, ALT 2000, volume 1968 of LNAI, pages 116–130. Springer, 2000.
E.M. Gold. Language identification in the limit. Inform. Control, 10:447–474, 1967.
T. Head, S. Kobayashi, and T. Yokomori. Locality, reversibility and beyond: Learning languages from positive data. In ALT 98, 9th International Conference on Algorithmic Learning Theory, volume 1501 of LNAI, pages 191–204. Springer-Verlag, 1998.
M. Kanazawa. Learnable Classes of Categorial Grammars. The European Association for Logic, Language and Information. CLSI Publications, 1998.
S. Kapur. Computational Learning of Languages. PhD thesis, Cornell University, 1991.
S. Kobayashi and T. Yokomori. Learning concatenations of locally testable languages from positive data. LNCS, 872:407–422, 1994.
Satoshi Kobayashi and Takashi Yokomori. Learning approximately regular languages with reversible languages. Theoretical Computer Science, 174(1–2):251–257, 15 March 1997. Note.
Yasubumi Sakakibara. Efficient learning of context-free grammars from positive structural examples. Information and Computation, 1992.
Sheng Yu. Handbook of Formal Languages, Regular Languages, volume 1, chapter 2, pages 41–110. Springer Verlag, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Denis, F., Lemay, A., Terlutte, A. (2002). Some Classes of Regular Languages Identifiable in the Limit from Positive Data. In: Adriaans, P., Fernau, H., van Zaanen, M. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2002. Lecture Notes in Computer Science(), vol 2484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45790-9_6
Download citation
DOI: https://doi.org/10.1007/3-540-45790-9_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44239-4
Online ISBN: 978-3-540-45790-9
eBook Packages: Springer Book Archive