### 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 language | English |
---|---|

Title of host publication | Algorithmic Learning Theory - 3rd Workshop, ALT 1992, Proceedings |

Publisher | Springer Verlag |

Pages | 41-52 |

Number of pages | 12 |

Volume | 743 LNAI |

ISBN (Print) | 9783540573692 |

Publication status | Published - 1993 |

Externally published | Yes |

Event | 3rd Workshop on Algorithmic Learning Theory, ALT 1992 - Tokyo, Japan Duration: 1992 Oct 20 → 1992 Oct 22 |

### Publication series

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

Volume | 743 LNAI |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 3rd Workshop on Algorithmic Learning Theory, ALT 1992 |
---|---|

Country | Japan |

City | Tokyo |

Period | 92/10/20 → 92/10/22 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

}

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 -