On learning systolic languages

Takashi Yokomori*

*この研究の対応する著者

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

We study the learning problem of systolic languages from queries and counterexamples. A systolic language is specified by a systolic automaton which is a kind of network consisting of uniformly connected processors(finite automata). In this article, we show that the class of binary systolic tree languages is learnable in polynomial time from the learning protocol what is called minimally adequate teacher. Since the class of binary systolic tree languages properly contains the class of regular languages, the main result in this paper gives a generalization of the corresponding Angluin’s result for regular languages.

本文言語English
ホスト出版物のタイトルAlgorithmic Learning Theory - 3rd Workshop, ALT 1992, Proceedings
編集者Shuji Doshita, Koichi Furukawa, Klaus P. Jantke, Toyaki Nishida
出版社Springer Verlag
ページ41-52
ページ数12
ISBN(印刷版)9783540573692
DOI
出版ステータスPublished - 1993
外部発表はい
イベント3rd Workshop on Algorithmic Learning Theory, ALT 1992 - Tokyo, Japan
継続期間: 1992 10 201992 10 22

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
743 LNAI
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other3rd Workshop on Algorithmic Learning Theory, ALT 1992
国/地域Japan
CityTokyo
Period92/10/2092/10/22

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「On learning systolic languages」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル