Highly Influenced

@inproceedings{Weber1988ADT, title={A Decomposition Theorem for Finite-Valued Tranducers and an Application to the Equivalence Problem}, author={Andreas Weber}, booktitle={MFCS}, year={1988} }

- Published 1988 in MFCS
DOI:10.1007/BFb0017179

We show: A finite-valued generalized sequential machine (GSM) M can be effectively decomposed into finitely many single-valued GSM's M~ ..... MN such that the relation realized by M is the union of the relations realized by M~ ..... MN. As an application of this decomposition we get a DTIME(22"~)-algorithm deciding the equivalence of finite-valued GSM's. By reduction, both results can be easily generalized to normalized finite transducers. Acknowledgement: I gratefully thank Helmut Seidl for… CONTINUE READING

### Presentations referencing similar topics