Abstract
Finite state transducers over semigroups can be regarded as a formal model of sequential reactive programs. In this paper we introduce a uniform technique for checking effectively functionality, k-valuedness, equivalence and inclusion for this model of computation in the case when a semigroup these transducers operate over is embeddable in a decidable group.
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
Alur, R., Cerny, P.: Streaming transducers for algorithmic verification of single-pass list-processing programs. In: Proc. of 38th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 599–610 (2011)
Blattner, M., Head, T.: Single-valued a-transducers. Journal of Computer and System Sciences 15, 310–327 (1977)
Blattner, M., Head, T.: The decidability of equivalence for deterministic finite transducers. Journal of Computer and System Sciences 19, 45–49 (1979)
Beal, M.-P., Carton, O., Prieur, C., Sakarovitch, J.: Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theoretical Computer Science 292 (2003)
Culik, K., Karhumaki, J.: The equivalence of finite-valued transducers (on HDTOL languages) is decidable. Theoretical Computer Science 47, 71–84 (1986)
Griffiths, T.: The unsolvability of the equivalence problem for \(\varepsilon \)-free nondeterministic generalized machines. Journal of the ACM 15, 409–413 (1968)
Gurari, E., Ibarra, O.: A note on finite-valued and finitely ambiguous transducers. Mathematical Systems Theory 16, 61–66 (1983)
Ibarra, O.: The unsolvability of the equivalence problem for Efree NGSM’s with unary input (output) alphabet and applications. SIAM Journal on Computing 4 (1978)
Malcev, A.I.: Uber die Einbettung von assoziativen Systemen. Gruppen, Rec. Math. (Mat. Sbornik) N.S. 6, 331–336 (1939)
Veanes, M., Hooimeijer, P., Livshits, B., et al.: Symbolic finite state transducers: algorithms and applications. In: Proc. of the 39th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (2012)
Sakarovitch, J., de Souza, R.: On the decomposition of k-valued rational relations. In: Proc. of 25th International Symposium on Theoretical Aspects of Computer Science, pp. 621–632 (2008)
Sakarovitch, J., de 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)
Schutzenberger, M.P.: Sur les relations rationnelles. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 209–213. Springer, Heidelberg (1975)
de Souza, R.: On the decidability of the equivalence for k-valued transducers. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 252–263. Springer, Heidelberg (2008)
Weber, A.: On the valuedness of finite transducers. Acta Informatica 27, 749–780 (1989)
Weber, A.: Decomposing finite-valued transducers and deciding their equivalence. SIAM Journal on Computing 22, 175–202 (1993)
Zakharov, V.A.: An efficient and unified approach to the decidability of equivalence of propositional program schemes. In: Proc. of the 25th International Colloquium “Automata, Languages and Programming”, pp. 247–258 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Zakharov, V.A. (2015). Equivalence Checking Problem for Finite State Transducers over Semigroups. In: Maletti, A. (eds) Algebraic Informatics. CAI 2015. Lecture Notes in Computer Science(), vol 9270. Springer, Cham. https://doi.org/10.1007/978-3-319-23021-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-23021-4_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23020-7
Online ISBN: 978-3-319-23021-4
eBook Packages: Computer ScienceComputer Science (R0)