Transducers and the Decidability of Independence in Free Monoids
Abstract A transducer-based general method is derived by which proofs of the decidability of independence of regular languages with respect to a given relation can be obtained. This permits a uniform proof of the decidability of certain code properties which so far has only been obtained using separate, quite different and ad hoc proofs.