We will show that transducers can efficiently implement several code properties. In particular the satisfaction and maximality decision questions are solvable for any of the definable properties. We also present randomized algorithms for the generation of maximal error-detecting codes. Most algorithms can be extended to alphabet-invariant transducers improving leading to more efficient algorithms and a more user friendly syntax.
Room M029, DMat-FCUP
Faculdade de Ciências da UP