Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries

Authors:
Cristina Tîrnăucă;Timo Knuutila
Affiliations:
Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tàrraco 1, Tarragona 43005, Spain;Department of Information Technology, University of Turku, Joukahaisenkatu 3-5 B, FI-20014 Turku, Finland
Venue:
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Year:
2007

Citing 17
Cited 3

A theory of the learnable

Communications of the ACM
Identification of pattern languages from examples and queries

Information and Computation
Learning regular sets from queries and counterexamples

Information and Computation
Negative Results for Equivalence Queries

Machine Learning
A polynomial-time algorithm for learning k-variable pattern languages from examples

COLT '89 Proceedings of the second annual workshop on Computational learning theory
Learning context-free grammars from structural data in polynomial time

Theoretical Computer Science
Learning non-deterministic finite automata from queries and counterexamples

Machine intelligence 13
Inference of Reversible Languages

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Queries and Concept Learning

Machine Learning
Queries and Concept Learning

Machine Learning
Characterization of Finite Identification

AII '92 Proceedings of the International Workshop on Analogical and Inductive Inference
Finding patterns common to a set of strings (Extended Abstract)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Query Learning of Regular Tree Languages: How to Avoid Dead States

Theory of Computing Systems
A characterization of the language classes learnable with correction queries

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Learning regular tree languages from correction and equivalence queries

Journal of Automata, Languages and Combinatorics
Learning DFA from correction and equivalence queries

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications

A Note on the Relationship between Different Types of Correction Queries

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
Types of trusted information that make DFA identification with correction queries feasible

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate two of the language classes intensively studied by the algorithmic learning theory community in the context of learning with correction queries. More precisely, we show that any pattern language can be inferred in polynomial time in length of the pattern by asking just a linear number of correction queries, and that k-reversible languages are efficiently learnable within this setting. Note that although the class of all pattern languages is learnable with membership queries, this cannot be done in polynomial time. Moreover, the class of k-reversible languages is not learnable at all using membership queries only.