A negative result on inductive inference of extended pattern languages

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

Volumn 2533, Issue , 2002, Pages 308-320

  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;

FORMAL LANGUAGE THEORY; INDUCTIVE INFERENCE; LEARNABILITY; NON-DETERMINISM; PATTERN LANGUAGES; TERMINAL SYMBOLS;

FORMAL LANGUAGES;

EID: 84942807458     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36169-3_25     Document Type: Conference Paper

References (18)

1. D. Angluin. Finding patterns common to a set of strings. In Proceedings, 11th Annual ACM Symposium on Theory of Computing, pages 130–141, 1979.
2. D. Angluin. Inductive inference of formal languages from positive data. Information and Control, 45:117–135, 1980.
3. J. Barzdin. Two theorems on the limiting synthesis of functions. Theory of Algorithms and Programs, Latvian State University, Riga, 210:82–88, 1974.
4. G.R. Baliga, J. Case, and S. Jain. Synthesizing enumeration techniques for language learning. In Proceedings of the Ninth Annual Conference on Computational Learning Theory, pages 169–180, 1996.
5. G.R. Baliga, J. Case, and S. Jain. The synthesis of language learners. Information and Computation, 152:16–43, 1999.
6. J. Case and L. Lynes. Machine inductive inference and language identification. In Lecture Notes in Computer Science, volume 140, pages 107–115. Proceeedings of the 9th International Colloquium on Automata, Languages and Programming, 1982.
7. E.M. Gold. Language identification in the limit. Information and Control, 10:447–474, 1967.
8. T. Jiang, E. Kinber, A. Salomaa, K. Salomaa, and S. Yu. Pattern languages with and without erasing. Intern. J. Computer Math., 50:147–163, 1994.
9. T. Jiang, A. Salomaa, K. Salomaa, and S. Yu. Decision problems for patterns. Journal of Computer and System Science, 50:53–63, 1995.
10. S. Lange and R. Wiehagen. Polynomial-time inference of arbitrary pattern languages. New Generation Computing, 8:361–370, 1991.
11. A.R. Mitchell. Learnability of a subclass of extended pattern languages. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory, pages 64–71, 1998.
12. A. Mateescu and A. Salomaa. Nondeterminism in patterns. In Lecture Notes in Computer Science, volume 775, pages 661–668. STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, 1994.
13. D. Osherson and S. Weinstein. Criteria of language learning. Information and Control, 52:123–138, 1982.
14. H. Rogers. Theory of Recursive Functions and Effective Computability. MIT Press, 1992. 3. print.
15. T. Shinohara. Polynomial time inference of extended regular pattern languages. In Lecture Notes in Computer Science, volume 147, pages 115–127. RIMS Symposia on Software Science and Engineering, Proceedings, Kyoto, 1982.
16. T. Shinohara. Polynomial time inference of pattern languages and its application. In Proceedings of the 7th IBM Symposium on Mathematical Foundations of Computer Science, pages 191–209, 1982.
17. K. Wright. Identification of unions of languages drawn from an identifiable class. In Proceedings of the Second Annual Workshop on Computational Learning Theory, pages 328–333, 1989.
18. R. Wiehagen and T. Zeugmann. Ignoring data may be the only way to learn efficiently. Journal of Experimental and Theoretical Artificial Intelligence, 6:131–144, 1994.