Skip to main content
SpringerLink
Log in

On the Decidability of the Equivalence for k-Valued Transducers

(Extended Abstract)

  • Conference paper
Developments in Language Theory (DLT 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5257))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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

  2. Weber, A.: Decomposing a k-valued transducer into k unambiguous ones. RAIRO Informatique Théorique et Applications 30(5), 379–413 (1996)

    MATH  Google Scholar 

  3. 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

    Google Scholar 

  4. 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)

    Article  MATH  MathSciNet  Google Scholar 

  5. Gurari, E., Ibarra, O.: A note on finite-valued and finitely ambiguous transducers. Mathematical Systems Theory 16, 61–66 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  6. Fischer, P.C., Rosenberg, A.L.: Multitape one-way nonwriting automata. Journal of Computer and System Sciences 2(1), 88–101 (1968)

    MATH  MathSciNet  Google Scholar 

  7. Griffiths, T.V.: The unsolvability of the equivalence problem for Λ-free nondeterministic generalized machines. Journal of the ACM 15(3), 409–413 (1968)

    Article  MATH  Google Scholar 

  8. 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)

    Article  MATH  MathSciNet  Google Scholar 

  9. 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)

    Google Scholar 

  10. Blattner, M., Head, T.: Single-valued a-transducers. Journal of Computer and System Sciences 15(3), 310–327 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  11. Culik, K., Karhumäki, J.: The equivalence of finite valued transducers (on HDT0L languages) is decidable. Theoretical Computer Science 47(1), 71–84 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  12. Weber, A.: Decomposing finite-valued transducers and deciding their equivalence. SIAM Journal on Computing 22(1), 175–202 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  13. Garey, M., Johnson, D.: Computers and Intractability. Freeman, New York (1979)

    MATH  Google Scholar 

  14. 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)

    Article  MATH  MathSciNet  Google Scholar 

  15. Sakarovitch, J.: A construction on finite automata that has remained hidden. Theoretical Computer Science 204(1–2), 205–231 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  16. Weber, A.: On the valuedness of finite transducers. Acta Informatica 27(8), 749–780 (1989)

    Google Scholar 

  17. Berstel, J.: Transductions and Context-Free Languages. B. G. Teubner (1979)

    Google Scholar 

  18. Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, London (1974)

    MATH  Google Scholar 

  19. Sakarovitch, J.: Éléments de théorie des automates. Vuibert, Paris (2003); English translation: Elements of Automata Theory. Cambridge University Press, Cambridge (to appear)

    Google Scholar 

  20. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. TELECOM ParisTech, 46, rue Barrault, 75634, Paris, Cedex 13

    Rodrigo de Souza

Authors
  1. Rodrigo de Souza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Masami Ito Masafumi Toyama

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation