Abstract
We show: A finite-valued generalized sequential machine (GSM) M can be effectively decomposed into finitely many single-valued GSM's M1,...,MN such that the relation realized by M is the union of the relations realized by M1,...,MN. As an application of this decomposition we get a DTIME(22 poly)-algorithm deciding the equivalence of finite-valued GSM's. By reduction, both results can be easily generalized to normalized finite transducers.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Blattner, T. Head: Single-Valued a-Transducers. JCSS 55 (1977), pp. 310–327.
K. Culik II, J. Karhumäki: The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable. TCS 47 (1986), pp. 71–84.
T. Griffiths: The Unsolvability of the Equivalence Problem for A-Free Non-deterministic Generalized Machines. JACM 15 (1968), pp. 409–413.
E. Gurari, O. Ibarra: The Complexity of Decision Problems for Finite-Turn Multi-counter Machines. JCSS 22 (1981), pp. 220–229.
E. Gurari, O. Ibarra: A Note on Finite-Valued and Finitely Ambiguous Transducers. Math. Systems Theory 16 (1983), pp. 61–66.
M. Harrison: Introduction to Formal Language Theory. Addison-Wesley, Reading, MA, 1978.
J. Hopcroft, J. Ullman: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, MA, 1979.
O. Ibarra: The Unsolvability of the Equivalence Problem for ε-Free NGSM's with Unary Input (Output) Alphabet and Applications. SIAM J. Comput. 7 (1978), pp. 524–532.
J. Karhumäki: The Equivalence of Mappings on Languages. Manuscript, 1986.
J. Karhumäki: On Recent Trends in Formal Language Theory. Proc. ICALP 1987, in: LNCS 267 (Springer-Verlag), pp. 136–162.
M. Schützenberger: Sur les relations rationnelles entre monoides libres. TCS 3 (1976), pp. 243–259.
A. Weber, H. Seidl: On the Degree of Ambiguity of Finite Automata. Proc. MFCS 1986, in: LNCS 233 (Springer-Verlag), pp. 620–629.
A. Weber: über die Mehrdeutigkeit und Wertigkeit von endlichen Automaten und Transducern. Dissertation, Goethe-Universität Frankfurt am Main, 1987.
A. Weber: A Decomposition Theorem for Finite-Valued Transducers and an Application to the Equivalence Problem. Interner Bericht 1/88, Fb. Informatik, Goethe-Universität Frankfurt am Main, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weber, A. (1988). A decomposition theorem for finite-valued transducers and an application to the equivalence problem. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017179
Download citation
DOI: https://doi.org/10.1007/BFb0017179
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50110-7
Online ISBN: 978-3-540-45926-2
eBook Packages: Springer Book Archive