### 抜粋

We investigate the learning problem of two-tape deterministic finite automata (2-tape DFAs) from queries and counterexamples. Instead of accepting a subset of ∑*, a 2-tape DFA over an alphabet ∑ accepts a subset of ∑* × ∑*, and therefore, it can specify a binary relation on ∑*. In [3] Angluin showed that the class of deterministic finite automata (DFAs) is learnable in polynomial time from membership queries and equivalence queries, namely, from a minimally adequate teacher (MAT). In this article we show that the class of 2-tape DFAs is learnable in polynomial time from MAT. More specifically, we show an algorithm that, given any language L accepted by an unknown 2-tape DFA M, learns from MAT a two-tape nondeterministic finite automaton (2-tape NFA) M' accepting L in time polynomial in n and l, where n is the size of M and l is the maximum length of any counterexample provided during the learning process.

元の言語 | English |
---|---|

ページ（範囲） | 259-270 |

ページ数 | 12 |

ジャーナル | Theory of Computing Systems |

巻 | 29 |

発行部数 | 3 |

出版物ステータス | Published - 1996 |

外部発表 | Yes |

### フィンガープリント

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computational Theory and Mathematics
- Mathematics(all)

### これを引用

*Theory of Computing Systems*,

*29*(3), 259-270.