Author:
Jain Sanjay,Ong Yuh Shin,Stephan Frank
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference13 articles.
1. Finding patterns common to a set of strings;Angluin;Journal of Computer and System Sciences,1980
2. Learning one-variable pattern languages very efficiently on average, in parallel and by asking queries;Erlebach;Theoretical Computer Science,2001
3. Bad news on decision problems for patterns;Freydenberger;Information and Computation,2010
4. Introduction to Automata Theory, Languages and Computation;Hopcroft,2001
5. Michael Kearns, Leonard Pitt, A polynomial-time algorithm for learning k-variable pattern languages from examples, in: Proceedings of the Second Annual Workshop on Computational Learning Theory, Santa Cruz, California, USA, 1989, pp. 57–71.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献