Identiflability of subspaces and homomorphic images of zero-reversible languages

Satoshi Kobayashi, Takashi Yokomori

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

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 am algebraic extension of Angluin's theorem in [Ang80] based on am algebraic characterization of zero-reversible languages given by [Pin87]. This generalized theorem tells us the importaace of Pin's chazacterization of zero-reversible languages using finitely generated groups in the context of identification in the limit from positive data.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages48-61
Number of pages14
Volume1316
ISBN (Print)3540635777, 9783540635772
DOIs
Publication statusPublished - 1997
Externally publishedYes
Event8th International Workshop on Algorithmic Learning Theory, ALT 1997 - Sendai, Japan
Duration: 1997 Oct 61997 Oct 8

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1316
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other8th International Workshop on Algorithmic Learning Theory, ALT 1997
CountryJapan
CitySendai
Period97/10/697/10/8

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Kobayashi, S., & Yokomori, T. (1997). Identiflability of subspaces and homomorphic images of zero-reversible languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1316, pp. 48-61). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1316). Springer Verlag. https://doi.org/10.1007/3-540-63577-7_35