Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem
Journal of the ACM (JACM)
Inference of Reversible Languages
Journal of the ACM (JACM)
Polynomial-time identification of very simple grammars from positive data
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
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
Probabilistic generalization of simple grammars and its application to reinforcement learning
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
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
Learning efficiency of very simple grammars from positive data
Theoretical Computer Science
Probabilistic generalization of simple grammars and its application to reinforcement learning
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
| Hi-index | 0.00 |
The class of very simple grammars is known to be polynomial-time identifiable in the limit from positive data. This paper introduces an extension of very simple grammars called right-unique simple grammars, and presents an algorithm that identifies right-unique simple grammars in the limit from positive data. The learning algorithm possesses the following three properties. It computes a conjecture in polynomial time in the size of the input data if we regard the cardinality of the alphabet as a constant. It always outputs a grammar which is consistent with the input data. It never changes the conjecture unless the newly provided example contradicts the previous conjecture. The algorithm has a sub-algorithm that solves the inclusion problem for a superclass of right-unique simple grammars, which is also presented in this paper.