More about learning elementary formal systems

  • Setsuo Arikawa
  • Satoru Miyano
  • Takeshi Shinohara
  • Ayumi Shinohara
Selected Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 659)


Elementary formal system (EFS for short) is a kind of logic program directly dealing with character strings. In 1989, we proposed the class of variable-bounded EFS's as a unifying framework for language learning. Responding to the proposal, several works have been developed. In this paper, a brief summary of these works on learning elementary formal systems, Shapiro's model inference approach, inductive inference from positive data, Valiant's PAC (probably approximately correct) learning approach, and applications to Molecular Biology, is presented.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Angluin, D.: Finding common patterns to a set of strings, Proc. 11th Annual ACM Symp. Theory of Computing, 130–141, 1979.Google Scholar
  2. [2]
    Angluin, D.: Inductive inference of formal languages from positive data, Inform. Contr., 45, 117–135, 1980.Google Scholar
  3. [3]
    Angluin, D. and Smith, C. H.: Inductive inference: Theory and methods, Computing Surveys, 15, 237–269, 1983.Google Scholar
  4. [4]
    Arikawa, S.: Elementary formal systems and formal languages — simple formal systems, Memoirs of Fac. Sci., Kyushu Univ. Ser. A, Math., 24, 47–75, 1970.Google Scholar
  5. [5]
    Arikawa, S., Shinohara, T. and Yamamoto, A.: Elementary formal system as a unifying framework for language learning, Proc. 2nd Workshop Comput. Learning Theory, 312–327, 1989.Google Scholar
  6. [6]
    Arikawa, S., Kuhara, S., Miyano, S., Shinohara, A. and Shinohara, T.: A learning algorithm for elementary formal systems and its experiments on identification of transmembrane domains, Proc. 25th Hawaii International Conference on System Sciences).Google Scholar
  7. [7]
    Arimura, H.: Completeness of depth-bounded resolution in logic programming, Proc. 6th Conf, Japan Soc. Software Sci. Tech., 61–64, 1989.Google Scholar
  8. [8]
    Blumer, A., Ehrenfeucht, A., Haussler, D. and Warmuth, M.: Occam's razor, Information Processing Letters, 24, 377–380, 1987.Google Scholar
  9. [9]
    Gold, E.M.: Language Identification in the Limit, Inf. & Contr., 10, 447–474, 1967.Google Scholar
  10. [10]
    Johnson, D.S.: Approximation algorithms for combinatorial problems, JCSS 9, 256–278, 1974.Google Scholar
  11. [11]
    Lloyd, J.W.: Foundations of Logic Programming, Springer-Verlag, 1984.Google Scholar
  12. [12]
    Miyano, S., Shinohara, A. and Shinohara, T.: Which classes of elementary formal systems are polynomial-time learnable ?, Proc. Algorithmic Learning Theory, 139–150, 1991.Google Scholar
  13. [13]
    Motoki, T., Shinohara, T. and Wright, K.:The correct definition of finite elasticity: Corrigendum to identification of unions, Proc. 4th Workshop Comput. Learning Theory, 375, 1991.Google Scholar
  14. [14]
    Natarajan, B.K.: On learning sets and functions, Machine Learning, 4, 67–97, 1989.Google Scholar
  15. [15]
    Protein Identification Resource, National Biomedical Research Foundation.Google Scholar
  16. [16]
    Shapiro, E.Y.: Inductive Inference of Theories From Facts, YALEU/DCS/TR-192, 1981.Google Scholar
  17. [17]
    Shapiro, E.Y.: Alternation and the computational complexity of logic programs, J. Logic Program., 1, 19–33, 1984.Google Scholar
  18. [18]
    Shinohara, T.: Polynomial time inference of pattern languages and its applications, Proc. 7th IBM Symposium on Mathematical Foundations of Computer Science, 191–209, 1982.Google Scholar
  19. [19]
    Shinohara, T.: Polynomial time inference of extended regular pattern languages, LNCS, 147, 115–127, 1983.Google Scholar
  20. [20]
    Shinohara, T.: Inferring unions of two pattern languages, Bull. Inf. Cybern., 20, 83–88, 1983.Google Scholar
  21. [21]
    Shinohara, T.: Inductive inference of formal systems from positive data, Bull. Inf. Cybern., 22, 9–18, 1986.Google Scholar
  22. [22]
    Shinohara, T.: Inductive inference from positive data is powerful, Proc. 3rd Workshop Comput. Learning Theory, 97–110, 1990 (to appear in Information and Computation as “Rich classes inferable from positive data: length-bounded elementary formal systems”).Google Scholar
  23. [23]
    Shinohara, T.: Inductive inference of monotonic formal systems from positive data, New Gener. Comput., 8, 371–384, 1991.Google Scholar
  24. [24]
    Smullyan, R. M.: Theory of Formal Systems, Princeton Univ. Press, 1961.Google Scholar
  25. [25]
    Valiant, L.G.: A theory of learnable, CACM, 27, 1134–1142, 1984.Google Scholar
  26. [26]
    Wright, K.: Identification of unions of languages drawn from an identifiable class, Proc. 2nd Workshop Comput. Learning Theory, 328–333, 1989.Google Scholar
  27. [27]
    Yamamoto, A.: Elementary formal system as a logic programming language, Proc. Logic Program. Conf. '89, ICOT, 123–132, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Setsuo Arikawa
    • 1
  • Satoru Miyano
    • 1
  • Takeshi Shinohara
    • 2
  • Ayumi Shinohara
    • 1
  1. 1.Research Institute of Fundamental Information ScienceKyushu University 33FukuokaJapan
  2. 2.Department of Artificial IntelligenceKyushu Institute of TechnologyIizukaJapan

Personalised recommendations