2- https://doi.org/10.1145/168304.168338
Learning two-tape automata from queries and counterexamples
- Jan 1, 1993
- Takashi Yokomori
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).
- # Deterministic Finite Automata
- # Equivalence Queries
- # Membership Queries
- # Binary Relation
- # Polynomial Time
- # Adequate Teacher
- # Learning Problem
