A Canonical Semi-Deterministic Transducer
- 30 September 2016
- journal article
- conference paper
- Published by SAGE Publications in Fundamenta Informaticae
- Vol. 146 (4) , 431-459
Abstract
We prove the existence of a canonical form for semi-deterministic transducers with sets of pairwise incomparable output strings. Based on this, we develop an algorithm which learns semi-deterministic transducers given access to translation queries. WKeywords
All Related Versions
This publication has 3 references indexed in Scilit:
- LEARNING THEORY IN THE ARITHMETIC HIERARCHYThe Journal of Symbolic Logic, 2014
- Anomalous Vacillatory LearningThe Journal of Symbolic Logic, 2009
- Interactive learning of node selecting tree transducerMachine Learning, 2006