|
Title
|
|
|
|
Active learning of sequential transducers with side information about the domain
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| Active learning is a setting in which a student queries a teacher, through membership and equivalence queries, in order to learn a language. Performance on these algorithms is often measured in the number of queries required to learn a target, with an emphasis on costly equivalence queries. In graybox learning, the learning process is accelerated by foreknowledge of some information on the target. Here, we consider graybox active learning of subsequential string transducers, where a regular overapproximation of the domain is known by the student. We show that there exists an algorithm to learn subsequential string transducers with a better guarantee on the required number of equivalence queries than classical active learning. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
Lecture notes in computer science. - Berlin, 1973, currens
|
|
|
Source (book)
|
|
|
|
Developments in language theory : 25th International Conference, DLT 2021, Porto, Portugal, August 16-20, 2021; Moreira, Nelma [édit], et al. [edit]
|
|
|
Source (series)
|
|
|
|
Theoretical computer science and general issues (LNTC); 12811
|
|
|
Publication
|
|
|
|
Cham
:
2021
|
|
|
ISBN
|
|
|
|
978-3-030-81507-3
978-3-030-81508-0
|
|
|
DOI
|
|
|
|
10.1007/978-3-030-81508-0_5
|
|
|
Volume/pages
|
|
|
|
12811
(2021)
, p. 54-65
|
|
|
ISI
|
|
|
|
000905608200005
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (open access)
|
|
|
|
|
|