TY - JOUR
T1 - Learning two-tape automata from queries and counterexamples
AU - Yokomori, T.
PY - 1996/5/1
Y1 - 1996/5/1
N2 - 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 Σ* x Σ*, 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.
AB - 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 Σ* x Σ*, 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.
UR - http://www.scopus.com/inward/record.url?scp=33748592828&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33748592828&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:33748592828
VL - 29
SP - 259
EP - 270
JO - Theory of Computing Systems
JF - Theory of Computing Systems
SN - 1432-4350
IS - 3
ER -