## Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 259-270 |

Number of pages | 12 |

Journal | Theory of Computing Systems |

Volume | 29 |

Issue number | 3 |

DOIs | |

Publication status | Published - 1996 Jan 1 |

Externally published | Yes |

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computational Theory and Mathematics