Learning two-tape automata from queries and counterexamples

研究成果: Conference contribution

1 引用 (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 Angluin showed that the class of deterministic finite automata (DFAs) is learnable in polynomial time from membership queries and equivalence queries, namely, from minimally adequate teacher (MAT). In this article we show that the class of 2-tape DFAs is learnable in polynomial time from MAT in the following sense that there effectively exists 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 for L and l is the maximum length of any counterexample provided during the learning process. This gives a generalization of the corresponding Angluin's result for DFAs.

元の言語English
ホスト出版物のタイトルProc 6 Annu ACM Conf Comput Learn Theory
編集者 Anon
出版場所New York, NY, United States
出版者Publ by ACM
ページ228-235
ページ数8
ISBN(印刷物)0897916115
出版物ステータスPublished - 1993
外部発表Yes
イベントProceedings of the 6th Annual ACM Conference on Computational Learning Theory - Santa Cruz, CA, USA
継続期間: 1993 7 261993 7 28

Other

OtherProceedings of the 6th Annual ACM Conference on Computational Learning Theory
Santa Cruz, CA, USA
期間93/7/2693/7/28

    フィンガープリント

ASJC Scopus subject areas

  • Engineering(all)

これを引用

Yokomori, T. (1993). Learning two-tape automata from queries and counterexamples. : Anon (版), Proc 6 Annu ACM Conf Comput Learn Theory (pp. 228-235). Publ by ACM.