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, Information and Control, 45 (1980), 117-135.
D. Angluin. Inference of Reversible Languages, Journal of the ACM, 29 (1982), 741-765.
S. Arikawa, T. Shinohara and A. Yamamoto. Learning Elementary Formal Sys- tems, Theoretical Computer Science, 95 (1992), 97-113.
J. Case and C. Smith. Anomaly Hierarchies of Mechanized Inductive Inference, Proc. of STOC, 1978, 314-319.
E. Mark Gold. Language Identification in the Limit. Information and Control, 10 (1967),447-474.
C. Higuera, J. Oncina. Inferring Deterministic Linear Languages. Proc. of COLT’02, 2002, 185-200.
M. Kanazawa. Identification in the Limit of Categorial Grammars. Journal of Logic, Language and Information, 5, 2 (1996), 115-155.
S. Kobayashi and T. Yokomori. Learning Approximately Regular Languages with Reversible Languages, Theor. Comput. Sci. 174, 1-2 (1997), 251-257.
S. Kobayashi and T.Yokomori. On Approximately Identifying Concept Classes in the Limit. Proc. of 6th International Workshop on Algorithmic Learning Theory, (Lecture Notes in Artificial Intelligence 997), Springer-Verlag, 1995, 298-312.
T. Motoki, T. Shinohara and K. Wright. The Correct Definition of Finite Elasticity: Corrigendum to Identification of Unions. Proc. of 4th Workshop on Computational Learning Theory, 1991, 375-375.
Y. Mukouchi. Inductive Inference of an Approximate Concept from Positive Data. Proc. of 5th International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 872, Springer-Verlag, Berlin, 1994, 484-499.
J. Oncina and P. Garcia. Inferring Regular Languages in Polynomial Update Time, Pattern Recognition and Image Analysis, World Scientific, 1991, 49-61.
Y. Sakakibara. Learning Context-Free Grammars from Structural Data in Polynomial Time, Theor. Comput. Sci., 76, 2-3 (1990), 223-242.
Y. Sakakibara and M Kondo. GA-based Learning of Context-Free Grammars using Tabular Representations. Proc. of International Conference on Machine Learning’99, 1999, 354-360.
M. Sato and K. Umayahara. Inductive Inferability for Formal Languages from Positive Data. IEICE Trans. Inf. & Syst., E75-D, 4 (1992), 415-419.
M. Sato and T. Moriyama. Inductive Inference of Length Bounded EFS’s from Positive Data. DMSIS-RR-94-2, Department of Mathematical Sciences and Information Sciences, Univ. of Osaka Pref., Japan, April 1994
M. Sato. Inductive Inference of Formal Languages. Bulletin of Informatics and Cybernetics, 27, 1 (1995).
T. Shinohara. Rich Classes Inferable from Positive Data : Length Bounded Elementary Formal Systems. Information and Computation, 108 (1994), 175-186.
R. M. Smullyan. Theory of Formal Systems. Princeton Univ. Press, 1961.
K. Wright. Identification of Unions of Languages Drawn from an Identifiable Class. Proc. of 2nd Workshop on Computational Learning Theory, 1989, 328-333.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Satoshi Kobayashi. In: Esik, Z., MartÃn-Vide, C., Mitrana, V. (eds) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-33461-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-33461-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33460-6
Online ISBN: 978-3-540-33461-3
eBook Packages: EngineeringEngineering (R0)