Abstract
We give a new proof for the decidability of the equivalence of two k-valued transducers, a result originally established by Culik and Karhümaki and independently by Weber. Our proof relies on two constructions we have recently introduced to decompose a k-valued transducer and to decide whether a transducer is k-valued. As a result, our proof is entirely based on the structure of the transducers under inspection, and the complexity it yields is of single exponential order on the number of states. This improves Weber’s result by one exponential.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Sakarovitch, J., Souza, R.: On the decomposition of k-valued rational relations. In: Albers, S., Weil, P. (eds.) Proceedings of STACS 2008, pp. 621–632 (2008), http://stacs-conf.org (to appear in Theory of Computing Systems) arXiv:0802.2823v1
Weber, A.: Decomposing a k-valued transducer into k unambiguous ones. RAIRO Informatique Théorique et Applications 30(5), 379–413 (1996)
Sakarovitch, J., Souza, R.: On the decidability of bounded valuedness for transducers. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 588–600. Springer, Heidelberg (2008), Preliminary full version with proofs in http://www.infres.enst.fr/~rsouza/DFV.pdf
Béal, M.P., Carton, O., Prieur, C., Sakarovitch, J.: Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theoretical Computer Science 292, 45–63 (2003)
Gurari, E., Ibarra, O.: A note on finite-valued and finitely ambiguous transducers. Mathematical Systems Theory 16, 61–66 (1983)
Fischer, P.C., Rosenberg, A.L.: Multitape one-way nonwriting automata. Journal of Computer and System Sciences 2(1), 88–101 (1968)
Griffiths, T.V.: The unsolvability of the equivalence problem for Λ-free nondeterministic generalized machines. Journal of the ACM 15(3), 409–413 (1968)
Ibarra, O.: The unsolvability of the equivalence problem for ε-free NGSM’s with unary input (output) alphabet and applications. SIAM Journal on Computing 7(4), 524–532 (1978)
Schützenberger, M.P.: Sur les relations rationnelles. In: Automata Theory and Formal Languages, 2nd GI Conference. LNCS, vol. 33, pp. 209–213. Springer, Heidelberg (1975)
Blattner, M., Head, T.: Single-valued a-transducers. Journal of Computer and System Sciences 15(3), 310–327 (1977)
Culik, K., Karhumäki, J.: The equivalence of finite valued transducers (on HDT0L languages) is decidable. Theoretical Computer Science 47(1), 71–84 (1986)
Weber, A.: Decomposing finite-valued transducers and deciding their equivalence. SIAM Journal on Computing 22(1), 175–202 (1993)
Garey, M., Johnson, D.: Computers and Intractability. Freeman, New York (1979)
Gurari, E., Ibarra, O.: The complexity of decision problems for finite-turn multicounter machines. Journal of Computer and System Sciences 22(2), 220–229 (1981)
Sakarovitch, J.: A construction on finite automata that has remained hidden. Theoretical Computer Science 204(1–2), 205–231 (1998)
Weber, A.: On the valuedness of finite transducers. Acta Informatica 27(8), 749–780 (1989)
Berstel, J.: Transductions and Context-Free Languages. B. G. Teubner (1979)
Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, London (1974)
Sakarovitch, J.: Éléments de théorie des automates. Vuibert, Paris (2003); English translation: Elements of Automata Theory. Cambridge University Press, Cambridge (to appear)
Sakarovitch, J.: The rational skimming theorem. In: Van, D.L., Ito, M. (eds.) Proc. of The Mathematical Foundations of Informatics (1999), pp. 157–172. World Scientific, Singapore (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Souza, R. (2008). On the Decidability of the Equivalence for k-Valued Transducers. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2008. Lecture Notes in Computer Science, vol 5257. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85780-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-85780-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85779-2
Online ISBN: 978-3-540-85780-8
eBook Packages: Computer ScienceComputer Science (R0)