Skip to main content
SpringerLink
Log in
Book cover

Latin American Symposium on Theoretical Informatics

LATIN 2000: LATIN 2000: Theoretical Informatics pp 397–406Cite as

Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1776))

Abstract

We described here a construction on transducers that give a new conceptual proof for two classical decidability results on transducers: it is decidable whether a finite transducer realizes a functional relation, and whether a finite transducer realizes a sequential relation. A better complexity follows then for the two decision procedures.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Béal, M.-P., Carton, O.: Determinization of transducers over finite and infinite words (to appear)

    Google Scholar 

  2. Berstel, J.: Transductions and context-free languages. Teubner, Stuttgart (1979)

    Book  Google Scholar 

  3. Berstel, J., Perrin, D.: Theory of codes. Academic Press, London (1985)

    MATH  Google Scholar 

  4. Blattner, M., Head, T.: Single valued a-transducers. J. Computer System Sci. 7, 310–327 (1977)

    Article  MathSciNet  Google Scholar 

  5. Bruyère, V., Reutenauer, C.: A proof of Choffrut’s theorem on subsequential functions. Theoret. Comput. Sci. 215, 329–335 (1999)

    Article  MathSciNet  Google Scholar 

  6. Carton, O., Choffrut, C., Prieur, C.: How to decide functionality of rational relations on infinite words (to appear)

    Google Scholar 

  7. Choffrut, C.: Une caractérisation des fonctions séquentielles et des fonctions souss séquentielles en tant que relations rationnelles. Theoret. Comput. Sci. 5, 325–337 (1977)

    Article  MathSciNet  Google Scholar 

  8. Choffrut, C.: A generalization of Ginsburg and Rose’s characterization of g-s-m mappings. In: Maurer, H.A. (ed.) ICALP 1979. LNCS, vol. 71, pp. 88–103. Springer, Heidelberg (1979)

    Chapter  Google Scholar 

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

    MATH  Google Scholar 

  10. Gurari, E.M., Ibarra, O.H.: Finite-valued and finitely ambiguous transducers. Math. Systems Theory 16, 61–66 (1983)

    Article  MathSciNet  Google Scholar 

  11. Reutenauer, C.: Subsequential functions: characterizations, minimization, examples. LNCS, vol. 464, pp. 62–79 (1990)

    Chapter  Google Scholar 

  12. Schützenberger, M.P.: Sur les relations rationnelles. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33. Springer, Heidelberg (1975)

    Google Scholar 

  13. Schützenberger, M.P.: Sur une variante des fonctions séquentielles. Theoret. Comput. Sci. 4, 47–57 (1977)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Gaspard Monge, Université Marne-La Vallée, Switzerland

    Marie-Pierre Béal & Olivier Carton

  2. LIAFA, Université Paris 7 / CNRS, Switzerland

    Christophe Prieur

  3. Laboratoire Traitement et Communication de l’Information, ENST / CNRS, Switzerland

    Jacques Sakarovitch

Authors
  1. Marie-Pierre Béal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olivier Carton
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christophe Prieur
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jacques Sakarovitch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ETH Zurich, Institute of Computational Science, CH-8092 Zurich and, Swiss Institute of Bioinformatics, Switzerland

    Gaston H. Gonnet

  2. Pedeciba Informática, Casilla de Correo 16120, Distrito 6, Montevideo, Uruguay

    Alfredo Viola

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Béal, MP., Carton, O., Prieur, C., Sakarovitch, J. (2000). Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_39

Download citation

  • DOI: https://doi.org/10.1007/10719839_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67306-4

  • Online ISBN: 978-3-540-46415-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation