A PAC Learnability of Simple Deterministic Languages

Authors:
Yasuhiro Tajima;Matsuaki Terada
Affiliations:
-;-
Venue:
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Year:
2002

Citing 7
Cited 0

A theory of the learnable

Communications of the ACM
Learning regular sets from queries and counterexamples

Information and Computation
Polynomial Time Learnability of Simple Deterministic Languages

Machine Learning
Machine learning: a theoretical approach

Machine learning: a theoretical approach
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
A Polynomial Time Learning Algorithm Simple Deterministic Languages via Membership Queries and a Representative Sample

ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Simple deterministic languages

SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show a polynomial time PAC learnability of simple deterministic languages with new defined queries and samples. In this paper, we define a new query called hashed membership query. This query takes a 3-tuple of words. Then it replies with the membership of the word which is the concatenation of these three words in addition whether the 3-tuple represents a nonterminal or not in the target grammar. With this query, the polynomial time PAC learnability is shown by the same analysis in [2] on the new suggested algorithm in this paper.