A Canonical Semi-Deterministic Transducer

Abstract

We prove the existence of a canonical form for semi-deterministic transducers with incomparable sets of output strings. Based on this, we develop an algorithm which learns semi-deterministic transducers given access to translation queries. We also prove that there is no learning algorithm for semi-deterministic transducers that uses only domain knowledge.

arXiv commentA shorter version has been published in the proceedings of ICGI 2014. This version will appear in an issue of Fundamenta Informaticae