Skip to main content
SpringerLink
Log in

Some problems on inductive inference from positive data

  • Lectures
  • Conference paper
  • First Online:
Mathematical Methods of Specification and Synthesis of Software Systems '85 (MMSSS 1985)

Part of the book series: Lecture Notes in Computer Science ((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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gold, E.M.: Language Identification in the Limit, Inform. Contr. 10, (1967), 447–474.

    Google Scholar 

  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. Angluin, D.: Inductive Inference of Formal Languages from Positive Data, Inform. Contr. 45, (1980), 117–135.

    Google Scholar 

  4. Arikawa,S.: A personal communication.

    Google Scholar 

  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. 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. Shinohara, T.: Inferring Unions of Two Pattern Languages, Bull. Informatics and Cybernetics, 20, (1983), 83–87.

    Google Scholar 

  8. Shinohara, T.: Inductive Inference from Negative Data, ibid., 21, (1985), 67–68.

    Google Scholar 

  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. Aho, A.V. and Corasick, M.J.: Efficient String Matching, Commun. ACM, 18, (1975), 333–340.

    Google Scholar 

  11. Maier, D.: The Complexity of Some Problems on Subsequences and Supersequences, JACM 25 (1978) 322–336.

    Google Scholar 

  12. Nix,R.P.: Editing by Example, Res. Report 280, Dept. Comp. Sci., Yale Univ., (1983).

    Google Scholar 

  13. Jantke, K.P.: Polynomial Time Inference of General Pattern Languages, Proc. STACS'84, LNCS 166, 1984, 314–325.

    Google Scholar 

  14. Botusharov,O.: Learning on the Basis of a Polynomial Time Pattern Synthesis Algorithm, Proc. MMSSSS'85, (to appear).

    Google Scholar 

  15. Shapiro,E.: Inductive Inference of Theories from Facts, Res. Report 192, Dept. Comp. Sci., Yale Univ., (1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Center, Kyushu University 91, 812, Fukuoka, Japan

    Takeshi Shinohara

Authors
  1. Takeshi Shinohara
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Bibel Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shinohara, T. (1986). Some problems on inductive inference from positive data. In: Bibel, W., Jantke, K.P. (eds) Mathematical Methods of Specification and Synthesis of Software Systems '85. MMSSS 1985. Lecture Notes in Computer Science, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16444-8_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-16444-8_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16444-9

  • Online ISBN: 978-3-540-39784-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation