A unified algorithm for extending classes of languages identifiable in the limit from positive data

Authors:
Mitsuo Wakatsuki;Etsuji Tomita;Go Yamada
Affiliations:
Department of Information and Communication Engineering, Faculty of Electro-Communications, The University of Electro-Communications, Chofu, Tokyo, Japan;Department of Information and Communication Engineering, Faculty of Electro-Communications, The University of Electro-Communications, Chofu, Tokyo, Japan;Department of Information and Communication Engineering, Faculty of Electro-Communications, The University of Electro-Communications, Chofu, Tokyo, Japan
Venue:
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Year:
2006

Citing 7
Cited 0

The grammatical inference problem for the Szilard languages of linear grammars

Information Processing Letters
On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata

Machine Learning
Inference of Reversible Languages

Journal of the ACM (JACM)
Theory of Codes

Theory of Codes
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
Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages

ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We are concerned with a unified algorithm for extending classes of languages identifiable in the limit from positive data. Let $ {\mathcal L} $ be a class of languages to be based on and let $ {\mathcal X} $ be a class of finite subsets of strings. The extended class of $ {\mathcal L} $, denoted by $ {\mathcal C}({\mathcal L}, {\mathcal X}) $, is defined by these ${\mathcal L} $ and $ {\mathcal X} $. Here we give a sufficient condition for $ {\mathcal C}({\mathcal L}, {\mathcal X}) $ to be identifiable in the limit from positive data and we present a unified identification algorithm for it. Furthermore, we show that some proper subclasses of $ {\mathcal C}({\mathcal L}, {\mathcal X}) $ are polynomial time identifiable in the limit from positive data in the sense of Yokomori.