Higher order recurrent networks and grammatical inference
Advances in neural information processing systems 2
Learning Automata from Ordered Examples
Machine Learning - Connectionist approaches to language learning
The minimum consistent DFA problem cannot be approximated within any polynomial
Journal of the ACM (JACM)
Extracting Refined Rules from Knowledge-Based Neural Networks
Machine Learning
Evolutionary algorithms and emergent intelligence
Evolutionary algorithms and emergent intelligence
Learning classifier systems: a complete introduction, review, and roadmap
Journal of Artificial Evolution and Applications
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Machine Learning
Machine Learning
ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
What Is the Search Space of the Regular Inference?
ICGI '94 Proceedings of the Second International Colloquium on Grammatical Inference and Applications
An incremental interactive algorithm for grammar inference
ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
Inductive Inference, DFAs, and Computational Complexity
AII '89 Proceedings of the International Workshop on Analogical and Inductive Inference
Use of learning classifier system for inferring natural language grammar
Design and application of hybrid intelligent systems
Grammatical Inference in Bioinformatics
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Deterministic Finite Automata with a Smart State Labeling Evolutionary Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Formal languages and their relation to automata
Formal languages and their relation to automata
Handbook of Computational Economics, Volume 2: Agent-Based Computational Economics (Handbook of Computational Economics)
Active Coevolutionary Learning of Deterministic Finite Automata
The Journal of Machine Learning Research
Learning grammars with a modified classifier system
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Classifier fitness based on accuracy
Evolutionary Computation
Grammar-Based Classifier System for Recognition of Promoter Regions
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Learning Classifier System Approach to Natural Language Grammar Induction
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part II
Q-learning based on hierarchical evolutionary mechanism
WSEAS Transactions on Systems and Control
Playing a toy-grammar with GCS
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Grammatical inference methodology for control systems
WSEAS Transactions on Computers
| Hi-index | 0.00 |
Grammatical Inference deals with the problem of learning structural models, such as grammars, from different sort of data patterns, such as artificial languages, natural languages, biosequences, speech and so on. This article describes a new grammatical inference tool, Grammar-based Classifier System (GCS) dedicated to learn grammar from data. GCS is a new model of Learning Classifier Systems in which the population of classifiers has a form of a context-free grammar rule set in a Chomsky Normal Form. GCS has been proposed to address both regular language induction and the natural language grammar induction as well as learning formal grammar for DNA sequence. In all cases near-optimal solutions or better than reported in the literature were obtained.