On learning systolic languages

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

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAlgorithmic Learning Theory - 3rd Workshop, ALT 1992, Proceedings
PublisherSpringer Verlag
Pages41-52
Number of pages12
Volume743 LNAI
ISBN (Print)9783540573692
Publication statusPublished - 1993
Externally publishedYes
Event3rd Workshop on Algorithmic Learning Theory, ALT 1992 - Tokyo, Japan
Duration: 1992 Oct 201992 Oct 22

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume743 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd Workshop on Algorithmic Learning Theory, ALT 1992
CountryJapan
CityTokyo
Period92/10/2092/10/22

Fingerprint

Formal languages
Regular Languages
Finite automata
Polynomials
Binary
Network protocols
Finite Automata
Automata
Counterexample
Polynomial time
Query
Learning
Language
Class

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yokomori, T. (1993). On learning systolic languages. In Algorithmic Learning Theory - 3rd Workshop, ALT 1992, Proceedings (Vol. 743 LNAI, pp. 41-52). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 743 LNAI). Springer Verlag.

On learning systolic languages. / Yokomori, Takashi.

Algorithmic Learning Theory - 3rd Workshop, ALT 1992, Proceedings. Vol. 743 LNAI Springer Verlag, 1993. p. 41-52 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 743 LNAI).

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

Yokomori, T 1993, On learning systolic languages. in Algorithmic Learning Theory - 3rd Workshop, ALT 1992, Proceedings. vol. 743 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 743 LNAI, Springer Verlag, pp. 41-52, 3rd Workshop on Algorithmic Learning Theory, ALT 1992, Tokyo, Japan, 92/10/20.
Yokomori T. On learning systolic languages. In Algorithmic Learning Theory - 3rd Workshop, ALT 1992, Proceedings. Vol. 743 LNAI. Springer Verlag. 1993. p. 41-52. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Yokomori, Takashi. / On learning systolic languages. Algorithmic Learning Theory - 3rd Workshop, ALT 1992, Proceedings. Vol. 743 LNAI Springer Verlag, 1993. pp. 41-52 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{bc00c5852b3946b18a775f21dfae8b60,
title = "On learning systolic languages",
abstract = "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.",
author = "Takashi Yokomori",
year = "1993",
language = "English",
isbn = "9783540573692",
volume = "743 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "41--52",
booktitle = "Algorithmic Learning Theory - 3rd Workshop, ALT 1992, Proceedings",
address = "Germany",

}

TY - GEN

T1 - On learning systolic languages

AU - Yokomori, Takashi

PY - 1993

Y1 - 1993

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0010598230&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0010598230&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0010598230

SN - 9783540573692

VL - 743 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 41

EP - 52

BT - Algorithmic Learning Theory - 3rd Workshop, ALT 1992, Proceedings

PB - Springer Verlag

ER -