On the learnability of erasing pattern languages in the query model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2842, Issue , 2003, Pages 129-143

  Lange, Steffen ^a   Zilles, Sandra ^b  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

^b Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; QUERY LANGUAGES; MATHEMATICAL MODELS; PROBLEM SOLVING;

EXTENDED MODEL; FINITE STRINGS; LANGUAGE LEARNING; LEARNING CAPABILITIES; NATURAL EXTENSION; PATTERN LANGUAGES; POLYNOMIAL-TIME; STANDARD QUERIES;

LEARNING SYSTEMS;

ERASING PATTERN; FINITE STRING; LANGUAGE LEARNING; VARIABLE SYMBOLS;

EID: 0242266052     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39624-6_12     Document Type: Conference Paper

References (18)

1. D. Angluin. Inductive inference of formal languages from positive data. Information and Control, 45:117-135, 1980.
2. D. Angluin. Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21:46-62, 1980.
3. D. Angluin. Queries and concept learning. Machine Learning, 2:319-342, 1988.
4. D. Angluin. Queries revisited. Proc. Int. Conf. on Algorithmic Learning Theory, LNAI 2225, 12-31, Springer, 2001.
5. S. Arikawa, S. Miyano, A. Shinohara, S. Kuhara, Y. Mukouchi, T. Shinohara. A machine discovery from amino acid sequences by decision trees over regular patterns. New Generation Computing, 11:361-375, 1993.
6. T. Erlebach, P. Rossmanith, H. Stadtherr, A. Steger, T. Zeugmann. Learning onevariable pattern languages very efficiently on average, in parallel, and by asking questions. Proc. Int. Conf. on Algorithmic Learning Theory, LNAI 1316, 260-276, Springer, 1997.
7. E. M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
8. J. E. Hopcroft, J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, 1979.
9. T. Jiang, A. Salomaa, K. Salomaa, S. Yu. Decision problems for patterns. Journal of Computer and System Sciences, 50:53-63, 1995.
10. S. Lange, T. Zeugmann. Types of monotonic language learning and their characterization. Proc. ACM Workshop on Computational Learning Theory, 377–390. ACM Press, 1992.
11. S. Matsumoto, A. Shinohara. Learning pattern languages using queries. Proc. European Conf. on Computational Learning Theory, LNAI 1208, 185-197, Springer, 1997.
12. A. Mitchell. Learnability of a subclass of extended pattern languages. Proc. ACM Workshop on Computational Learning Theory, 64-71, ACM-Press, 1998.
13. J. Nessel, S. Lange. Learning erasing pattern languages with queries. Proc. Int. Conf. on Algorithmic Learning Theory, LNAI 1968, 86-100, Springer, 2000.
14. D. Reidenbach. A negative result on inductive inference of extended pattern languages. Proc. Int. Conf. on Algorithmic Learning Theory, LNAI 2533, 308-320, Springer, 2002.
15. A. Salomaa. Patterns (the formal language theory column). EATCS Bulletin, 54:46-62, 1994.
16. A. Salomaa. Return to patterns (the formal language theory column). EATCS Bulletin, 55:144-157, 1995.
17. T. Shinohara. Polynomial time inference of extended regular pattern languages. Proc. RIMS Symposium on Software Science and Engineering, LNCS 147, 115-127, Springer, 1983.
18. T. Zeugmann, S. Lange. A guided tour across the boundaries of learning recursive languages. Algorithmic Learning for Knowledge-Based Systems, LNAI 961, 190-258, Springer, 1995.