On the learnability of E-pattern languages over small alphabets

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3120, Issue , 2004, Pages 140-154

  Reidenbach, Daniel ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER SCIENCE; LEARNING SYSTEMS; LINGUISTICS; MATHEMATICAL MODELS; THEOREM PROVING; COMPUTABILITY AND DECIDABILITY;

E-PATTERN LANGUAGES; GOLD'S LEARNING MODEL; REASONING; STRINGS; LEARNABILITY; LEARNING MODELS; PATTERN LANGUAGES; POSITIVE DATA; SIDE EFFECT; THEORETICAL COMPUTER SCIENCE;

FORMAL LANGUAGES; COMPUTATIONAL LINGUISTICS;

EID: 9444279657     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-27819-1_10     Document Type: Conference Paper

References (24)

1. D. Angluin. Finding patterns common to a set of strings. J. Comput. Syst. Sci., 21:46-62, 1980.
2. D. Angluin. Inductive inference of formal languages from positive data. Inf. Control, 45:117-135, 1980.
3. D. Angluin and C. Smith. Inductive inference: Theory and methods. Comput. Surv., 15:237-269, 1983.
4. Ja.M. Barzdin and R.V. Freivald. On the prediction of general recursive functions. Soviet Math. Dokl, 13:1224-1228, 1972.
5. G. Dány and Z. Fülöp. A note on the equivalence problem of E-patterns. Inf. Process. Lett., 57:125-128, 1996.
6. E.M. Gold. Language identification in the limit. Inf. Control, 10:447-474, 1967.
7. T. Jiang, E. Kinber, A. Salomaa, K. Salomaa, and S. Yu. Pattern languages with and without erasing. Int. J. Comput. Math., 50:147-163, 1994.
8. T. Jiang, A. Salomaa, K. Salomaa, and S. Yu. Decision problems for patterns. J. Comput. Syst. Sci., 50:53-63, 1995.
9. S. Lange and R. Wiehagen. Polynomial-time inference of arbitrary pattern languages. New Generat. Comput., 8:361-370, 1991.
10. A. Mateescu and A. Salomaa. Finite degrees of ambiguity in pattern languages. KAIRO Inform, théor., 28(3-4):233-253, 1994.
11. A.R. Mitchell. Learnability of a subclass of extended pattern languages. In Proc. COLT 1998, pages 64-71, 1998.
12. E. Ohlebusch and E. Ukkonen. On the equivalence problem for E-pattern languages. Theor. Comp. Sci., 186:231-248, 1997.
13. D. Reidenbach. A non-learnable class of E-pattern languages. Theor. Comp. Sci., to appear.
14. D. Reidenbach. A negative result on inductive inference of extended pattern languages. In Proc. ALT 2002, volume 2533 of LNAI, pages 308-320, 2002.
15. D. Reidenbach. A discontinuity in pattern inference. In Proc. STACS 2004, volume 2996 of LNCS, pages 129-140, 2004.
16. D. Reidenbach. On the equivalence problem for E-pattern languages over four letters. In Proc. MFCS 2004, LNCS, 2004. Submitted.
17. R. Reischuk and T. Zeugmann. Learning one-variable pattern languages in linear average time. In Proc. COLT 1998, pages 198-208, 1998.
18. H. Rogers. Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, Mass., 1992. 3rd print.
19. G. Rozenberg and A. Salomaa. Handbook of Formal Languages, volume 1. Springer, Berlin, 1997.
20. T. Shinohara. Polynomial time inference of extended regular pattern languages. In Proc. RIMS Symp., volume 147 of LNCS, pages 115-127, 1982.
21. T. Shinohara and S. Arikawa. Pattern inference. In Algorithmic Learning for Knowledge-Based Systems, volume 961 of LNAI, pages 259-291. Springer, 1995.
22. A. Thue. Über unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I Mat. Nat. Kl., 7, 1906.
23. R. Wiehagen and T. Zeugmann. Ignoring data may be the only way to learn efficiently, J. Exp. Theor. Artif. Intell., 6:131-144, 1994.
24. T. Zeugmann and S. Lange. A guided tour across the boundaries of learning recursive languages. In Algorithmic Learning for Knowledge-Based Systems, volume 961 of LNAI, pages 190-258. Springer, 1995.