Skip to main content
SpringerLink
Log in
Book cover

LITP Spring School on Theoretical Computer Science

LITP 1988: Formal Properties of Finite Automata and Applications pp 34–55Cite as

Relational morphisms, transductions and operations on languages

  • Mathematical Foundations Of The Theory Of Automata
  • Conference paper
  • First Online:

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

Abstract

We have seen that, for the most part, natural operations on (varieties of) languages corrspond to natural operations on (varieties of) monoids: concatenation corresponds to aperiodic relational morphisms and to Schützenberger products, non ambiguous concatenation to locally trivial relational morphisms, length preserving morphisms to power monoids, sequential functions to wreath products, etc. In some cases, the corresponding operation is still unknown: for instance, it would be interesting to find an operation on languages corresponding to nilpotent relational morphisms,a nd an operation on monoids corresponding to shuffle. This correspondence between languages and monoids has motivated numerous research articles, and a number of problems are still open: on the semigroup side, the complete classification of the varieties of the form PV or the (many) decidability problems about varieties of the form V- 1 W or V*W; on the language side, the characterisation of varieties closed under shuffle or under pure star, and all problems related to the star operation and to the concatenation product (see the articles of P. Weil and K. Hashiguchi in this volume).

This work was supported by "Programme de Recherches Coordonnées — Mathématique et Informatique".

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel, Transductions and Context-free Languages, Teubner, Stuttgart, 1979.

    Google Scholar 

  2. S. Eilenberg, Automata, Languages and Machines, Academic Press, New York, Vol. A, 1974; Vol B, 1976.

    Google Scholar 

  3. K. Hashiguchi, A decision procedure for the order of regular events, Theoret. Comput. Sci. 8 (1979) 69–72.

    Google Scholar 

  4. K. Hashiguchi, Limitedness theorem on finite automata with distance functions, J. of Computer and System Sciences 24, (1982), 232–244.

    Google Scholar 

  5. K. Hashiguchi, Representation theorems on regular languages, J. Comput. System Sci. 27 (1983) 101–115.

    Article  Google Scholar 

  6. K. Hashiguchi, Regular languages of star-height one, Information and Control 53 (1982) 199–210.

    Article  Google Scholar 

  7. K. Hashiguchi, Improved limitedness theorems on finite automata with distance functions, Rapport LITP 86–72 (1986).

    Google Scholar 

  8. J.E. Pin, Langages reconnaissables et codage préfixe pur. 8th ICALP, Lecture Notes in Computer Science 115 (1981) 184–192.

    Google Scholar 

  9. J.E. Pin, Varieties of formal languages, Masson, Paris (1984), North Oxford Academic, London and Plenum, New-York (1986).

    Google Scholar 

  10. J.E. Pin, Power semigroups and related varieties of finite semigroups, Semigroups and Their Applications, édité par S.M. Goberstein et P.M. Higgins, D. Reidel (1986) 139–152.

    Google Scholar 

  11. J.E. Pin, H. Straubing and D. Thérien, Locally trivial categories and unambiguous concatenation, Journal of Pure and Applied Algebra 52 (1988) 297–311.

    Google Scholar 

  12. J.E. Pin and J. Sakarovitch, Operations and transductions that preserve rationality, 6ème GI Conference, Lecture Notes in Computer Science 145 (1983) 617–628.

    Google Scholar 

  13. J.E. Pin and J. Sakarovitch, Une application de la représentation matricielle des transductions, Theoretical Computer Science 35 (1985) 271–293.

    Article  Google Scholar 

  14. Ch. Reutenauer, Sur les variétés de langages et de monoïdes, Lecture Notes in Computer Science 67, Springer, Berlin, 1979, 260–265.

    Google Scholar 

  15. H. Straubing, Recognizable sets and power sets of finite semigroups, Semigroup Forum, 18 (1979) 331–340.

    Google Scholar 

  16. H. Straubing, Aperiodic homomorphisms and the concatenation product of recognizable sets, Journal of Pure and Applied Algebra 15 (1979) 319–327.

    Article  Google Scholar 

  17. H. Straubing, Relational morphisms and operations on recognizable sets, RAIRO Inf. Théor., 15 (1981) 149–159.

    Google Scholar 

  18. B. Tilson, Chapters XI and XII of reference [2].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LITP, Université Paris VI et CNRS, France

    Jean-Eric Pin

Authors
  1. Jean-Eric Pin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. E. Pin

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pin, JE. (1989). Relational morphisms, transductions and operations on languages. In: Pin, J.E. (eds) Formal Properties of Finite Automata and Applications. LITP 1988. Lecture Notes in Computer Science, vol 386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013110

Download citation

  • DOI: https://doi.org/10.1007/BFb0013110

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51631-6

  • Online ISBN: 978-3-540-46721-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation