Skip to main content
SpringerLink
Log in

Representation and uniformization of algebraic transductions

  • Original article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

This paper explores different means of representation for algebraic transductions, i.e., word relations realized by pushdown transducers. The relevance of this work lies more in its point of view rather than any particular result. We are aiming at giving specific techniques for obtaining, or perhaps explaining, decompositions of algebraic (and incidentally, rational) relations, relying solely on their “machine” definition rather than some complex algebraic apparatus. From this point of view, we are hoping to have demystified the heavy formalism employed in the present literature. Some of the novelties of our work are: the use of “stack languages” and “embeddings,” which eliminate the need of arbitrary context-free languages in our characterizations, the study of uniformizations for algebraic transductions and the use of the so-called stack transductions for exposing the anatomy of pushdown transducers.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  1. Aho A.V., Ullman J.D. (1972) The Theory of Parsing, Translation and Compiling, vol. 1. Prentice-Hall, Englewood Cliffs

    Google Scholar 

  2. Autebert, J.-M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, vol. 1, Word Language Grammar, pp. 111–174. Springer, Berlin Heidelberg New York (1997)

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

  4. Choffrut C., Culik K. (1983) Properties of finite and pushdown transducers. SIAM J Comput 12(2): 300–315

    Article  MATH  MathSciNet  Google Scholar 

  5. Cohen A. Program analysis and transformation: from the polytope model to formal languages. Thése de Doctorat de l’Universitè de Versailles, reported by Jean Berstel (1999)

  6. Eilenberg S. (1967) Algèbre Catégorique et Théorie des Automates. Institut H. Poincaré, Université de Paris

    Google Scholar 

  7. Eilenberg S. (1974) Automata, Languages and Machines, vol. A. Academic, New York

    MATH  Google Scholar 

  8. Eilenberg S. (1976) Automata, Languages and Machines, vol. B. Academic, New York

    MATH  Google Scholar 

  9. Fliess M. (1970) Transductions algebriques. R.A.I.R.O., R1, 109–125

    MATH  MathSciNet  Google Scholar 

  10. Ginsburg S. (1966) The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York

    MATH  Google Scholar 

  11. Kobayashi K. (1969) Classification of formal languages by functional binary transductions. Info Control, 15(1): 95–109

    Article  MATH  Google Scholar 

  12. Nivat M. (1968) Transductions des langages de Chomsky. Ann Inst Fourier 18, 339–456

    MATH  MathSciNet  Google Scholar 

  13. Sakarovitch J. (2003) Éléments de Théorie des Automates. Vuibert Informatique, Paris

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computing Science, Saint Mary’s University, Halifax, B3H 3C3, NS, Canada

    Stavros Konstantinidis

  2. David R. Cheriton School of Computer Science, University of Waterloo, Waterloo, N2L 3G1, ON, Canada

    Nicolae Santean

  3. Department of Computer Science, University of Western Ontario, London, N6A 5B8, ON, Canada

    Sheng Yu

Authors
  1. Stavros Konstantinidis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicolae Santean
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sheng Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nicolae Santean.

Additional information

This work was supported by the Natural Science and Engineering Research Council of Canada grants R220259 and OGP0041630.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Konstantinidis, S., Santean, N. & Yu, S. Representation and uniformization of algebraic transductions. Acta Informatica 43, 395–417 (2007). https://doi.org/10.1007/s00236-006-0027-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-006-0027-7

Keywords

Search

Navigation