Paper Info
Title
Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages
Abstract
In this paper, we study two operations of taking subspaces and homomorphic images of identifiable concept classes from positive data. We give sufficient conditions for the identifiable classes to be identifiable from positive data after the applications of those two operations. As one of the examples to show the effectiveness of the obtained theorems, we will apply them to the class of zero-reversible languages, and obtain some interesting identifiable language classes related to reversible languages. Further, we will show a connection of those theories to the theory of approximate identification in the limit from positive data([Kob96]). Another important contribution of this paper is an algebraic extension of Angluin's theorem in [Ang80] based on an algebraic characterization of zero-reversible languages given by [Pin87]. This generalized theorem tells us the importance of Pin's characterization of zero-reversible languages using finitely generated groups in the context of identification in the limit from positive data.
Year
DOI
Venue
1997
10.1007/3-540-63577-7_35
ALT
Keywords
Field
DocType
zero-reversible languages,homomorphic images
Discrete mathematics,Algebraic number,Concept class,Computer science,Sequence,Identifiability,Linear subspace,Algebraic extension,Homomorphism,Artificial intelligence,Regular language,Machine learning
Conference
Volume
ISSN
ISBN
1316
0302-9743
3-540-63577-7
Citations 
PageRank 
References 
11
0.61
10
Authors
2
Name
Order
Citations
PageRank
Satoshi Kobayashi113715.51
Takashi Yokomori277793.85