Learning two-tape automata from queries and counterexamples

研究成果: Article

5 引用 (Scopus)

抜粋

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 nonde-terministic 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
ジャーナルMathematical Systems Theory
29
発行部数3
DOI
出版物ステータスPublished - 1996 6
外部発表Yes

    フィンガープリント

ASJC Scopus subject areas

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

これを引用