Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages
Identifiability of Subspaces and Homomorphic Images of Zero-Reversible Languages
复制标题
零可逆语言的子空间和同态图像的可辨识性
DOI：
10.1007/3-540-63577-7_35
复制
发表时间：
1997
期刊：
影响因子：
7.5
通讯作者：
T. Yokomori
中科院分区：
文献类型：
--
作者：
Satoshi Kobayashi;T. Yokomori
本文研究了从正数据中获取可识别概念类的子空间和同态像的两种操作。我们给出了充分条件的可识别类是可识别的正数据后，这两个操作的应用程序。作为证明所得定理有效性的例子之一，我们将把它们应用于零可逆语言类，并得到一些有趣的与可逆语言相关的可识别语言类.此外，我们将展示这些理论与正数据极限近似识别理论的联系（[Kob 96]）。本文的另一个重要贡献是在[Pin87]给出的零可逆语言的代数特征的基础上，对[Ang80]中的Angluin定理进行了代数推广。这一广义定理告诉我们的重要性，引脚的零可逆语言的特点，在识别的范围内，从积极的数据限制使用生成群。
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.