A discontinuity in pattern inference

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

Volumn 2996, Issue , 2004, Pages 129-140

  Reidenbach, Daniel ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BINARY ALPHABETS; LEARNABILITY; LEARNING MODELS; PATTERN LANGUAGES; POSITIVE DATA;

COMPUTATIONAL LINGUISTICS;

EID: 9444273644     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_12     Document Type: Article

References (20)

1. D. Angluin. Finding patterns common to a set of strings. In Proc. STOC 1979, pages 130-141, 1979.
2. D. Angluin. Inductive inference of formal languages from positive data. Inf. Control, 45:117-135, 1980.
3. G. Filè. The relation of two patterns with comparable language. In Proc. STAGS 1988, volume 294 of LNCS, pages 184-192, 1988.
4. E.M. Gold. Language identification in the limit. Inf. Control, 10:447-474, 1967.
5. 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.
6. T. Jiang, A. Salomaa, K. Salomaa, and S. Yu. Decision problems for patterns. J. Comput. Syst. Sci., 50:53-63, 1995.
7. S. Lange and R. Wiehagen. Polynomial-time inference of arbitrary pattern languages. New Generat. Comput., 8:361-370, 1991.
8. M. Lipponen and G. Pǎun. Strongly prime PCP words. Discrete Appl. Math., 63:193-197, 1995.
9. A. Mateescu and A. Salomaa. PCP-prime words and primality types. RAIRO Inform, théor., 27(1):57-70, 1993.
10. A. Mateescu and A. Salomaa. Finite degrees of ambiguity in pattern languages. RAIRO 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. D. Reidenbach. A non-learnable class of E-pattern languages. Theor. Comp. Sci., to appear.
13. D. Reidenbach. A negative result on inductive inference of extended pattern languages. In Proc. ALT 2002, volume 2533 of LNAI, pages 308-320, 2002.
14. R. Reischuk and T. Zeugmann. Learning one-variable pattern languages in linear average time. In Proc. COLT 1998, pages 198-208, 1998.
15. H. Rogers. Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, Mass., 1992. 3rd print.
16. G. Rozenberg and A. Salomaa. Handbook of Formal Languages, volume 1. Springer, Berlin, 1997.
17. T. Shinohara. Polynomial time inference of extended regular pattern languages. In Proc. RIMS Symposia on Software Science and Engineering, Kyoto, volume 147 of LNCS, pages 115-127, 1982.
18. A. Thue. Über unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I Mat. Nat. Kl., 7, 1906.
19. R. Wiehagen and T. Zeugmann. Ignoring data may be the only way to learn efficiently. J. Exp. Theor. Artif. Intell, 6:131-144, 1994.
20. K. Wright. Identification of unions of languages drawn from an identifiable class. In Proc. COLT 1989, pages 328-333, 1989.