Refinement and Implementation of Algorithmic Tools for
            Deciding the Error-detection Property

              Alifasi Daka and Stavros Konstantinidis

We consider new and refine existing algorithmic tools for deciding 
whether a given regular language is error-detecting for a given rational 
channel, with the aim of providing tractable implementations of these 
concepts. The algorithmic tools involve product constructions between 
automata and transducers, a decision procedure for functionality of  
transducers, and the new concept of pseudo-sequential transducer. Our 
implementation is written in C++ using Grail-style libraries. To our 
knowledge this is the first implementation deciding the error-detection 
property at this level of generality, which brings us one step closer to 
the development of practical software for investigating the 
error-detecting capabilities of communication languages.