Abstract
We give a new and conceptually different proof for the decidability of k-valuedness of transducers (a result due to Gurari and Ibarra), without resorting to any other kind of machines than transducers. In contrast with the previous proof, our algorithm takes into account the structure of the analysed transducers and yields better complexity bounds. With the same techniques, we also present a new proof, hopefully more easily understandable, for the decidability of bounded valuedness (a result due to Weber).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
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.
References
Schützenberger, M.P.: Sur les relations rationnelles. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 209–213. Springer, Heidelberg (1975)
Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, London (1974)
Weber, A.: On the valuedness of finite transducers. Acta Informatica 27(8), 749–780 (1989)
Gurari, E., Ibarra, O.: A note on finite-valued and finitely ambiguous transducers. Mathematical Systems Theory 16, 61–66 (1983)
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)
Weber, A.: Decomposing a k-valued transducer into k unambiguous ones. RAIRO Informatique Théorique et Applications 30(5), 379–413 (1996)
Sakarovitch, J., de Souza, R.: On the decomposition of k-valued rational relations. In: Albers, S., Weil, P. (eds.) Proceedings of STACS 2008, pp. 621–632 (2008) arXiv:0802.2823v1, http://stacs-conf.org (to appear in Theory of Computing Systems)
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)
de Souza, R.: On the decidability of the equivalence of k-valued transducers (submitted)
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)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (2001)
Mandel, A., Simon, I.: On finite semigroups of matrices. Theoretical Computer Science 5(2), 101–111 (1977)
Weber, A., Seidl, H.: On the degree of ambiguity of finite automata. Theoretical Computer Science 88, 325–349 (1991)
Sakarovitch, J., de Souza, R.: On the decidability of finite valuedness of transducers (manuscript), http://www.infres.enst.fr/~rsouza/DFV.pdf
Berstel, J.: Transductions and Context-Free Languages. B. G. Teubner (1979)
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.: A construction on finite automata that has remained hidden. Theoretical Computer Science 204(1–2), 205–231 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakarovitch, J., de Souza, R. (2008). On the Decidability of Bounded Valuedness for Transducers. In: Ochmański, E., Tyszkiewicz, J. (eds) Mathematical Foundations of Computer Science 2008. MFCS 2008. Lecture Notes in Computer Science, vol 5162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85238-4_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-85238-4_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85237-7
Online ISBN: 978-3-540-85238-4
eBook Packages: Computer ScienceComputer Science (R0)