Learning regular sets from queries and counterexamples
Information and Computation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Negative Results for Equivalence Queries
Machine Learning
Identification of unions of languages drawn from an identifiable class
COLT '89 Proceedings of the second annual workshop on Computational learning theory
The grammatical inference problem for the Szilard languages of linear grammars
Information Processing Letters
Remarks on the structural grammatical inference problem for context-free grammars
Information Processing Letters
Rich classes inferable from positive data
Information and Computation
Towards a mathematical theory of machine discovery from facts
Theoretical Computer Science - Special issue on algorithmic learning theory
Learning Local Languages and Their Application to DNA Sequence Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
Inference of Reversible Languages
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Inductive Inference, DFAs, and Computational Complexity
AII '89 Proceedings of the International Workshop on Analogical and Inductive Inference
LARS: A learning algorithm for rewriting systems
Machine Learning
Learning indexed families of recursive languages from positive data: A survey
Theoretical Computer Science
Learning Efficiency of Very Simple Grammars from Positive Data
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs
Language and Automata Theory and Applications
A Polynomial Algorithm for the Inference of Context Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Learning Left-to-Right and Right-to-Left Iterative Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Identification in the Limit of k,l-Substitutable Context-Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Learning efficiency of very simple grammars from positive data
Theoretical Computer Science
IEICE - Transactions on Information and Systems
Learning auxiliary fronting with grammatical inference
CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
A note on contextual binary feature grammars
CLAGI '09 Proceedings of the EACL 2009 Workshop on Computational Linguistic Aspects of Grammatical Inference
Polynomial time identification of strict prefix deterministic finite state transducers
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Using Contextual Representations to Efficiently Learn Context-Free Languages
The Journal of Machine Learning Research
Formal and empirical grammatical inference
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts of ACL 2011
Probabilistic generalization of simple grammars and its application to reinforcement learning
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Identification in the limit of substitutable context-free languages
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Inductive inference and language learning
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Ten open problems in grammatical inference
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Polynomial-time identification of an extension of very simple grammars from positive data
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Learning in the limit with lattice-structured hypothesis spaces
Theoretical Computer Science
| Hi-index | 0.00 |
This paper concerns a subclass of simple deterministic grammars, called very simple grammars, and studies the problem of identifying the subclass in the limit from positive data. The class of very simple languages forms a proper subclass of simple deterministic languages and is incomparable to the class of regular languages. This class of languages is also known as the class of left Szilard languages of context-free grammars.After providing some properties of very simple languages, we show that the class of very simple grammars is polynomial-time identifiable in the limit from positive data in the following sense. That is, we show that there effectively exists an algorithm that, given a target very simple grammar G* over alphabet Σ, identifies a very simple grammar G equivalent to G* in the limit from positive data, satisfying the property that the time for updating a conjecture is bounded by O(m), and the total number of prediction errors made by the algorithm is bounded by O(n), where n is the size of G*, m = Max{N|Σ|+1, |Σ|3} and N is the total length of all positive data provided.