Learning erasing pattern languages with queries

Theoretical Computer Science

Volumn 348, Issue 1, 2005, Pages 41-57

  Nessel, Jochen ^a   Lange, Steffen ^b  

^a University of Koblenz Landau   (Germany)

^b Fachbereich Informatik   (Germany)

Author keywords

Algorithmic learning; Formal language theory; Query inference

Indexed keywords

CODES (SYMBOLS); FINITE ELEMENT METHOD; LEARNING SYSTEMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

ALGORITHMIC LEARNING; FORMAL LANGUAGE THEORY; QUERY INFERENCE;

QUERY LANGUAGES;

EID: 27744443481     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.001     Document Type: Conference Paper

References (23)

1. D. Angluin Finding patterns common to a set of strings J. Comput. System Sci. 21 1980 46 62
2. D. Angluin Queries and concept learning Machine Learning 2 1988 319 342
3. D. Angluin, Queries revisited, in: Proc. Internat. Conf. on Algorithmic Learning Theory (ALT'01), Lecture Notes in Artificial Intelligence, Vol. 2225, Springer, Berlin, 2001, pp. 12-31.
4. T. Erlebach, P. Rossmanith, H. Stadtherr, A. Steger, T. Zeugmann, Learning one-variable pattern languages very efficiently on average, in parallel, and by asking questions, in: Proc. Internat. Conf. on Algorithmic Learning Theory (ALT'97), Lecture Notes in Artificial Intelligence, Vol. 1316, Springer, Berlin, 1997, pp. 260-276.
5. E.M. Gold Language identification in the limit Inform. and Control 10 1967 447 474
6. J.E. Hopcroft, and J.D. Ullman Introduction to Automata Theory, Languages, and Computation 1979 Addison-Wesley Reading, MA
7. T. Jiang, A. Salomaa, K. Salomaa, and S. Yu Decision problems for patterns J. Comput. System Sci. 50 1995 53 63
8. M. Kearns, L. Pitt, A polynomial-time algorithm for learning k-variable pattern languages from examples, in: Proc. Workshop on Computational Learning Theory (COLT'89), Morgan Kaufmann, Los Altos, CA, 1989, pp. 57-71.
9. S. Lange, and R. Wiehagen Polynomial-time inference of arbitrary pattern languages New Generation Computing 8 1991 361 370
10. A. Marron, Learning pattern languages from a single initial example and from queries, in: Proc. Workshop on Computational Learning Theory (COLT'88), Morgan Kaufmann, Los Altos, CA, 1988, pp. 345-358.
11. A. Marron, and K. Ko Identification of pattern languages from examples and queries Inform. and Comput. 74 1987 91 112
12. S. Matsumoto, A. Shinohara, Learning pattern languages using queries, in: Proc. European Conf. on Computational Learning Theory (EuroCOLT'97), Lecture Notes in Artificial Intelligence, Vol. 1208, Springer, Berlin, 1997, pp. 185-197.
13. A. Mitchell, Learnability of a subclass of extended pattern languages, in: Proc. ACM Workshop on Computational Learning Theory (COLT'98), ACM-Press, New York, 1998, pp. 64-71.
14. R.P. Nix, Editing by examples, Ph.D. Thesis, Technical Report 280, Yale University, Department of Computer Science, 1983.
15. D. Reidenbach, A negative result on inductive inference of extended pattern languages, in: Proc. Internat. Conf. on Algorithmic Learning Theory (ALT'02), Lecture Notes in Artificial Intelligence, Vol. 2533, Springer, Berlin, 2002, pp. 308-320.
16. R. Reischuk, and T. Zeugmann An average-case optimal one-variable language learner J. Comput. System Sci. 60 2000 302 335
17. P. Rossmanith, T. Zeugmann, Learning k-variable pattern languages efficiently stochastically finite on average from positive data, in: Proc. Grammatical Inference, 4th International Colloquium (ICGI'98), Lecture Notes in Artificial Intelligence, Vol. 1433, Springer, Berlin, 1998, pp. 13-24.
18. A. Salomaa Patterns (the formal language theory column) EATCS Bull. 54 1994 46 62
19. A. Salomaa Return to patterns (the formal language theory column) EATCS Bull. 55 1994 144 157
20. T. Shinohara, Polynomial time inference of extended regular pattern languages, in: Proc. RIMS Symp. on Software Science and Engineering, Lecture Notes in Computer Science, Vol. 147, Springer, Berlin, 1983, pp. 115-127.
21. T. Shinohara, S. Arikawa, Pattern inference, in: Algorithmic Learning for Knowledge-Based Systems, Lecture Notes in Artificial Intelligence, Vol. 961, Springer, Berlin, 1995, pp. 259-291.
22. H. Rogers Jr. Theory of Recursive Functions and Effective Computability 1987 MIT Press Cambridge, MA
23. L.G. Valiant A theory of the learnable Commun. ACM 27 1984 1134 1142