Commutative regular shuffle closed languages, noetherian property, and learning theory

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

To develop computational learning theory of commutative regular shuffle closed languages, we study finite elasticity for classes of (semi)group-like structures. One is the class of ANd + F such that A is a matrix of size e × d with nonnegative integer entries and F consists of at most k number of e-dimensional nonnegative integer vectors, and another is the class Xd k of AZd + F such that A is a square matrix of size d with integer entries and F consists of at most k number of ddimensional integer vectors (F is repeated according to the lattice AZd). Each class turns out to be the elementwise unions of k-copies of a more manageable class. So we formulate "learning time" of a class and then study in general setting how much "learning time" is increased by the elementwise union, by using Ramsey number. We also point out that such a standpoint can be generalized by using Noetherian spaces.

本文言語English
ホスト出版物のタイトルLanguage and Automata Theory and Applications - Third International Conference, LATA 2009, Proceedings
ページ93-104
ページ数12
DOI
出版ステータスPublished - 2009 7 13
イベント3rd International Conference on Language and Automata Theory and Applications, LATA 2009 - Tarragona, Spain
継続期間: 2009 4 22009 4 8

出版物シリーズ

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

Other

Other3rd International Conference on Language and Automata Theory and Applications, LATA 2009
国/地域Spain
CityTarragona
Period09/4/209/4/8

ASJC Scopus subject areas

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

フィンガープリント

「Commutative regular shuffle closed languages, noetherian property, and learning theory」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル