Advertisement

Some problems on inductive inference from positive data

  • Takeshi Shinohara
Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 215)

Abstract

This paper describes some problems on inductive inference of formal languages from positive data: polynomial time inference and its application to practical problem, inference of unions, and inference from negative data.

Keywords

Polynomial Time Inductive Inference Positive Data Negative Data Variable Symbol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Gold, E.M.: Language Identification in the Limit, Inform. Contr. 10, (1967), 447–474.Google Scholar
  2. [2]
    Angluin,D.: Finding Patterns Common to a Set of Strings, Proc. 11th Annual Symposium on Theory of Computing, (1979), 130–141.Google Scholar
  3. [3]
    Angluin, D.: Inductive Inference of Formal Languages from Positive Data, Inform. Contr. 45, (1980), 117–135.Google Scholar
  4. [4]
    Arikawa,S.: A personal communication.Google Scholar
  5. [5]
    Shinohara,T.: Polynomial Time Inference of Pattern Languages ant Its Applications, Proc. 7th IBM Symposium on Mathematical Foundations of Computer Science, (1982), 193–209.Google Scholar
  6. [6]
    Shinohara, T.: Polynomial Time Inference of Extended Regular Pattern Languages, Proc. RIMS Symposia on Software Science and Engineering, LNCS 147, (1982), 115–127.Google Scholar
  7. [7]
    Shinohara, T.: Inferring Unions of Two Pattern Languages, Bull. Informatics and Cybernetics, 20, (1983), 83–87.Google Scholar
  8. [8]
    Shinohara, T.: Inductive Inference from Negative Data, ibid., 21, (1985), 67–68.Google Scholar
  9. [9]
    Arikawa, S., Shinohara, T., Shiraishi, S. and Tamakoshi, Y.: SIGMA — An Information System for Researchers Use, ibid., 20, (1982), 97–114.Google Scholar
  10. [10]
    Aho, A.V. and Corasick, M.J.: Efficient String Matching, Commun. ACM, 18, (1975), 333–340.Google Scholar
  11. [11]
    Maier, D.: The Complexity of Some Problems on Subsequences and Supersequences, JACM 25 (1978) 322–336.Google Scholar
  12. [12]
    Nix,R.P.: Editing by Example, Res. Report 280, Dept. Comp. Sci., Yale Univ., (1983).Google Scholar
  13. [13]
    Jantke, K.P.: Polynomial Time Inference of General Pattern Languages, Proc. STACS'84, LNCS 166, 1984, 314–325.Google Scholar
  14. [14]
    Botusharov,O.: Learning on the Basis of a Polynomial Time Pattern Synthesis Algorithm, Proc. MMSSSS'85, (to appear).Google Scholar
  15. [15]
    Shapiro,E.: Inductive Inference of Theories from Facts, Res. Report 192, Dept. Comp. Sci., Yale Univ., (1981).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Takeshi Shinohara
    • 1
  1. 1.Computer CenterKyushu University 91FukuokaJapan

Personalised recommendations