Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
437863 | Theoretical Computer Science | 2010 | 8 Pages |
Abstract
We construct a transducer for the bidirectional decoding of words encoded by the method introduced by Girod (1999) in [5] and we prove that it is bideterministic and that it can be used both for the left-to-right and the right-to-left decoding.We also give a similar construction for a transducer that decodes in both directions words encoded by a generalization of Girod’s encoding method. We prove that it has the same properties as those of the previous transducer. In addition we show that it has a single initial/final state and that it is minimal.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics