On learning systolic languages

Takashi Yokomori*

*Corresponding author for this work

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

3 Citations (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.

Original languageEnglish
Title of host publicationAlgorithmic Learning Theory - 3rd Workshop, ALT 1992, Proceedings
EditorsShuji Doshita, Koichi Furukawa, Klaus P. Jantke, Toyaki Nishida
PublisherSpringer Verlag
Number of pages12
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


Other3rd Workshop on Algorithmic Learning Theory, ALT 1992

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'On learning systolic languages'. Together they form a unique fingerprint.

Cite this