ACM Transactions on Programming Languages and Systems (TOPLAS)
Learnability of a subclass of extended pattern languages
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Inductive Inference: Theory and Methods
ACM Computing Surveys (CSUR)
Theoretical Computer Science
Annals of Mathematics and Artificial Intelligence
On learning unions of pattern languages and tree patterns in the mistake bound model
Theoretical Computer Science
On Learning Unions of Pattern Languages and Tree Patterns
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
The VC-Dimension of Subclasses of Pattern
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Learning Erasing Pattern Languages with Queries
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Compactness and Learning of Classes of Unions of Erasing Regular Pattern Languages
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
A Negative Result on Inductive Inference of Extended Pattern Languages
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Prediction-Preserving Reducibility with Membership Queries on Formal Languages
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
A practical algorithm to find the best subsequence patterns
Theoretical Computer Science
Learning elementary formal systems with queries
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Decision lists over regular patterns
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Ordered term tree languages which are polynomial time inductively inferable from positive data
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
A non-learnable class of E-pattern languages
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Learning erasing pattern languages with queries
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Learning of erasing primitive formal systems from positive examples
Theoretical Computer Science - Algorithmic learning theory
Learning a subclass of regular patterns in polynomial time
Theoretical Computer Science - Algorithmic learning theory
Some natural conditions on incremental learning
Information and Computation
Learning indexed families of recursive languages from positive data: A survey
Theoretical Computer Science
Discontinuities in pattern inference
Theoretical Computer Science
Developments from enquiries into the learnability of the pattern languages from positive data
Theoretical Computer Science
Learning Block-Preserving Outerplanar Graph Patterns and Its Application to Data Mining
ILP '08 Proceedings of the 18th international conference on Inductive Logic Programming
Bad News on Decision Problems for Patterns
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Journal of Automata, Languages and Combinatorics
Necessary and sufficient conditions for learning with correction queries
Theoretical Computer Science
Bad news on decision problems for patterns
Information and Computation
ILP'02 Proceedings of the 12th international conference on Inductive logic programming
A polynomial time algorithm for finding linear interval graph patterns
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Mining maximal flexible patterns in a sequence
JSAI'07 Proceedings of the 2007 conference on New frontiers in artificial intelligence
Existence and nonexistence of descriptive patterns
Theoretical Computer Science
Regular patterns, regular languages and context-free languages
Information Processing Letters
International Journal of Geographical Information Science
Automatic learning of subclasses of pattern languages
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Towards a better understanding of incremental learning
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Inferring unions of the pattern languages by the most fitting covers
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Best fitting fixed-length substring patterns for a set of strings
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Polynomial time inductive inference of TTSP graph languages from positive data
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
Measuring over-generalization in the minimal multiple generalizations of biosequences
DS'05 Proceedings of the 8th international conference on Discovery Science
On the equivalence problem for e-pattern languages over small alphabets
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Polynomial-Time algorithms for learning typed pattern languages
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Patterns with bounded treewidth
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Learning twig and path queries
Proceedings of the 15th International Conference on Database Theory
Polynomial time inductive inference of cograph pattern languages from positive data
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
Inside the class of REGEX languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Regular and context-free pattern languages over small alphabets
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Automatic learning of subclasses of pattern languages
Information and Computation
Inclusion problems for patterns with a bounded number of variables
Information and Computation
Inferring descriptive generalisations of formal languages
Journal of Computer and System Sciences
A note on the complexity of matching patterns with variables
Information Processing Letters
Regular and context-free pattern languages over small alphabets
Theoretical Computer Science
| Hi-index | 0.01 |