Polynomial-time learning of elementary formal systems

New Generation Computing

Volumn 18, Issue 3, 2000, Pages 217-242

  Miyano, Satoru ^a   Shinohara, Ayumi ^b   Shinohara, Takeshi ^c  

^a UNIVERSITY OF TOKYO   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

^c KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; POLYNOMIALS;

ELEMENTARY FORMAL SYSTEMS (EFS);

LOGIC PROGRAMMING;

EID: 0033726227     PISSN: 02883635     EISSN: None     Source Type: Trade Journal    
DOI: 10.1007/BF03037530     Document Type: Article

References (31)

1. Abe, N., "Polynomial Learnability and Locality of Formal Grammars," in Proc. 26th Meeting of the Assciation for Computational Linguistics, 1988.
2. Angluin, D., "Finding Patterns Common to a Set of Strings," Journal of Computer and System Sciences, 21, pp. 46-62, 1980.
3. Angluin, D., "Learning Regular Sets from Queries and Counterexamples," Information and Computation, 75, pp. 87-106, 1987.
4. 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," in Proc. 25th Hawaii International Conference on System Sciences, Vol. I, pp. 675-684, 1992.
5. Arikawa, S., Shinohara, T., and Yamamoto, A., "Learning Elementary Formal Systems," Theoretical Computer Science, 95, pp. 97-113, 1992.
6. Arimura, H., Personal Communication, 1993.
7. Berger, B., Rompel, J., and Shor, P., "Efficient NC Algorithms for Set Cover with Application to Learning and Geometry," in Proc. of the 30th Annual Symposium on Foundations of Computer Science, pp. 54-59, 1989.
8. Blumer, A., Ehrenfeucht, A., Haussler, D., and Warmuth, M., "Learnability and the Vapnik-Chervonenkis Dimension," JACM, 36, 4, pp. 929-965, 1989.
9. Chvatal, V., "A Greedy Heuristic for the Set Covering Problem," Mathematics of Operations Research, 4, 3, pp. 233-235, 1979.
10. Gold, E., "Language Identification in the Limit," Information and Control, 10, pp. 447-474, 1967.
11. Haussler, D., Kearns, M., Littlestone, N., and Warmuth, M., "Equivalence of Models for Polynomial Learnability," in Proc. of the 1st Workshop on Computational Learning Theory, pp. 34-50, 1988.
12. Jiang, T. and Li, M., "On the Complexity of Learning Strings and Sequences," in Proc. of the 4th Annual Workshop on Computational Learning Theory, pp. 367-371, 1991.
13. 2-complete Problems in Computational Learning Theory," Computational Complexity, 1, 3, pp. 269-310, 1991.
14. Maier, D., "The Complexity of Some Problems on Subsequences and Supersequences," JACM, 25, pp. 322-336, 1978.
15. Moriyama, T. and Sato, M., "Properties of Language Classes with Finite Elasticity," in Proc. 4th International Workshop on Algorithmic Learning Theory (Lecture Notes In Artificial Intelligence 744), pp. 187-196, 1993.
16. Mukouchi, Y. and Arikawa, S., "Inductive Inference Machines that can Refute Hypothesis Spaces," in Proc. 4th International Workshop on Algorithmic Learning Theory (Lecture Notes in Artificial Intelligence 744), pp. 123-136, 1993.
17. Natarajan, B., "On Learning Sets and Functions," Machine Learning, 4, 1, pp. 67-97, 1989.
18. Natarajan, B., Machine Learning - A Theoretical Approach, Morgan Kaufmann Publishers, 1991.
19. Ruzzo, W., "Tree-size Bounded Alternation," Journal of Computer and System Sciences, 21, 2, pp. 218-235, 1980.
20. Ruzzo, W., "On Uniform Circuit Complexity," Journal of Computer and System Sciences, 22, 3, pp. 365-383, 1981.
21. Sakakibara, Y., "On Learning Smullyan's Elementary Formal Systems: Towards an Efficient Learning for Context-sensitive Languages," Advances in Software Science and Technology, 2, pp. 79-101, 1990.
22. Schapire, R., "Pattern Languages are not Learnable," in Proceedings of the 3rd Annual Workshop on Computational Learning Theory, pp. 122-129, 1990.
23. Shinohara, T., "Polynomial Time Inference of Pattern Languages and its Applications," in Proc. 7th IBM Symp. Math. Found. Comp. Sci., pp. 191-209, 1982.
24. Shinohara, T., "Polynomial Time Inference of Extended Regular Pattern Languages," Lecture Notes in Computer Science, 147, pp. 115-127, 1983.
25. Shinohara, T., "Inductive Inference from Positive Data is Powerful," in Proceedings of the 3rd Annual Workshop on Computational Learning Theory, pp. 97-110, 1990.
26. Smullyan, R., Theory of Formal Systems, Princeton University Press, 1961.
27. Sudborough, I., "On the Tape Complexity of Deterministic Context-free Languages," JACM, 25, 3, pp. 405-414, 1978.
28. Valiant, L., "A Theory of the Learnable," CACM, 27, 11, pp. 1134-1142, 1984.
29. Vitter, J. S. and Lin, J.-H., "Learning in Parallel," Information and Computation, 96, pp. 179-202, 1992.
30. Wagner, R. and Fischer, M., "The String-to-string Correction Problem," JACM, 21, pp. 168-73, 1974.
31. Yamamoto, A., "Procedural Semantics and Negative Information of Elementary Formal System," Journal of Logic Programming, 13, 1, pp. 89-97, 1992.