Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1986: Mathematical Foundations of Computer Science 1986 pp 15–28Cite as

Recent results in the theory of rational sets

  • Invited Lectures
  • Conference paper
  • First Online:

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

Abstract

This paper presents a survey of recent results in the theory of rational sets in arbitrary monoids. Main topics considered here are : the so-called Kleene monoids (i.e. monoids where Kleene's theorem holds), rational functions and relations, rational sets in partially commutative monoids, and rational sets in free groups.

This work has been partly supported by the Programme de Recherche Coordonnée "Mathématiques et Informatique" du Ministère de la Recherche et de la Technologie.

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. Aalbersberg IJ. J. and E. Welzl, Trace languages defined by regular string languages. To appear in RAIRO Inform. Théor.

    Google Scholar 

  2. Aalbersberg IJ. J. and G. Rozenberg, Theory of traces. Tech. Rep. 85-16, Univ. Leiden.

    Google Scholar 

  3. Amar V. and G. Putzolu, Generalization of regular events. Inform. and Control 8 (1965), 56–63.

    Google Scholar 

  4. Anisimov A. V. and D. Knuth, Inhomogeneous sorting. Unpublished manuscript.

    Google Scholar 

  5. Anisimov A. V. and F. D. Seifert, Zur algebraischen Charakteristik der durch kontextfreie Sprachen definierten Gruppen, E.I.K. 11, (1975), 695–702.

    Google Scholar 

  6. Arnold A. and M. Latteux, A new proof of two theorems about rational transductions. Theor. Comput. Sci. 8 (1979), 261–263.

    Google Scholar 

  7. Benois M., Parties rationnelles du groupe libre, C.R. Acad. Sci. Paris, Ser. A, 269 (1969), 1188–1190.

    Google Scholar 

  8. Berstel J., Transductions and Context-Free Languages, Teubner, 1979.

    Google Scholar 

  9. Bertoni A., Mauri G. and N. Sabadini, Unambiguous regular trace languages. In: Algebra, Combinatorics, and Logic in Computer Science (J. Demetrovics, G. Katona, and A. Salomaa, eds.), Colloquia Mathematica Soc. J. Boyai 42, North Holland (1985).

    Google Scholar 

  10. Cartier P. and D. Foata, Problèmes combinatoires de commutations et réarrangements. Lecture Notes in Math. 85, Springer, 1969.

    Google Scholar 

  11. Choffrut Ch. and M. P. Schützenberger, Décomposition de fonctions rationnelles. In: Proc. 3rd Symp. Theor. Aspects Comput. Sci. (B. Monien, G. Vidal-Naquet eds.), Lect. Notes Comput. Sci. 210 (1986), 213–226.

    Google Scholar 

  12. Choffrut Ch., Une caractérisation des fonctions séquentielles et des fonctions sous-séquentielles en tant que relations rationnelles. Theor. Comput. Sci. 5 (1977), 325–338.

    Google Scholar 

  13. Cori R. and D. Perrin, Automates et commutations partielles. RAIRO Inform. Théor. 19 (1985), 21–32.

    Google Scholar 

  14. Cori R. and Y. Métivier, Recognizable subsets of some partially abelian monoids. Theor. Comput. Sci. 35 (1985), 179–189.

    Google Scholar 

  15. Čulik II K., E. Fich and A. Salomaa, A homomorphic characterization of regular languages. Discrete Appl. Math. 4 (1982), 149–152.

    Google Scholar 

  16. Duboc Ch., On some equations in free partially commutative monoids. To appear in Theor. Comput. Sci.

    Google Scholar 

  17. Eilenberg S. and M. P. Schützenberger, Rational sets in commutative monoids. J. of Algebra 13 (1969), 344–353.

    Google Scholar 

  18. Eilenberg S., Automata, Languages and Machines, Vol. A. Academic Press, 1974.

    Google Scholar 

  19. Elgot C. and G. Mezei, On relations defined by generalized finite automata. IBM J. of Res. Dev. 9 (1965), 47–65.

    Google Scholar 

  20. Fischer P. and A. Rosenberg, Multitape one-way nonwriting automata. J. Comput. and Syst. Sci. 2 (1968), 88–101.

    Google Scholar 

  21. Flé M. P. and G. Roucairol, Maximal serializability of iterated transactions. Theor. Comput. Sci. 38 (1985), 1–16.

    Google Scholar 

  22. Fliess M., Deux applications de la représentation matricielle d'une série rationnelle non commutative. J. of Algebra 19 (1971), 344–353.

    Google Scholar 

  23. Fliess M., Matrices de Hankel. J. Math. pures et appl. 53 (1974), 197–224.

    Google Scholar 

  24. Frougny Ch., J. Sakarovitch and P. Schupp, Finiteness conditions on subgroups and formal language theory. Tech. Rep. Litp 85-66.

    Google Scholar 

  25. Frougny Ch., Fibonacci numeration systems and rational functions. This volume.

    Google Scholar 

  26. Ginsburg S. and E. H. Spanier, Bounded ALGOL-like languages. Trans. Am. Math. Soc. 113 (1964), 333–368.

    Google Scholar 

  27. Ginsburg S. and E. H. Spanier, Semigroups, Presburger formulas, and languages. Pacif. J. Math. 16 (1966), 285–296.

    Google Scholar 

  28. Ginsburg S. and G. Rose, A characterization of machine mappings. Can. J. of Math. 18 (1966), 381–388.

    Google Scholar 

  29. Gohon Ph., An algorithm to decide whether a rational subset of Nk is recognizable. Theor. Comput. Sci. 41 (1986).

    Google Scholar 

  30. Johnson J., Do rational equivalence relations have regular cross-section? Proc. 12th Intern. Conf. Automata, Languages and Programming, Lect. Notes Comput. Sci. 194 (1985), 300–309.

    Google Scholar 

  31. Johnson J., A Rational Equivalence Relation Hierarchiy. Tech. Rep. University of Waterloo, November 1985.

    Google Scholar 

  32. Karhumaki J. and M. Linna, A note on morphic characterization of languages. Discrete Appl. Math. 5 (1983), 243–246.

    Google Scholar 

  33. Kobayashi K., Classification of formal languages by functional binary transductions, nform. and Control 15 (1969), 95–109.

    Google Scholar 

  34. Latteux M., and P. Turakainen, A new normal form for compositions of morphisms and inverse morphisms. Tech. Rep. IT-66-84, Université Lille I, July 1984.

    Google Scholar 

  35. Latteux M. and J. Leguy, On the composition of morphisms and inverse morphisms. Lect. Notes Comput. Sci. 154 (1983), 420–432.

    Google Scholar 

  36. Leguy J., Transductions rationnelles décroissantes. RAIRO Inform. Théor. 15 (1981), 141–148.

    Google Scholar 

  37. Lothaire M., Combinatorics on Words. Encyclop. of Math. 17, Addison-Wesley, 1983.

    Google Scholar 

  38. McKnight Jr. J. D. and A. J. Storey, Equidivisible semigroups. J. of Algebra 12 (1968), 24–48.

    Google Scholar 

  39. Mazurkiewicz A., Traces, histories, and graphs: instances of a process monoid. Proc. of Math. Foundations Comput. Sci. 84, Lect. Notes Comput. Sci. 176, (1984), 115–133.

    Google Scholar 

  40. Métivier Y., Une condition suffisante de reconaissabilité dans un monoïde partiellement commutatif. To appear in RAIRO Inform. Théor.

    Google Scholar 

  41. Ochmanski E., Regular behaviour of concurrent systems. Bull. European Assoc. Theor. Comput. Sci., October 1985.

    Google Scholar 

  42. Pelletier M. and J. Sakarovitch, Easy Multiplications II. Extensions of rational monoids. In preparation.

    Google Scholar 

  43. Perrin D., Words over a partially commutative alphabet. Tech. Rep. Litp 84-59.

    Google Scholar 

  44. Reutenauer Ch., Sur les semi-groupes vérifiant le théorème de Kleene. RAIRO Inform. Théor. 19 (1985), 281–291.

    Google Scholar 

  45. Sakarovitch J., Deux remarques sur un théorème de S. Eilenberg. RAIRO Inform. Théor. 17 (1983), 23–48.

    Google Scholar 

  46. Sakarovitch J., On regular trace languages. To appear.

    Google Scholar 

  47. Sakarovitch J., Easy Multiplications. I. The realm of Kleene's Theorem. To appear in Inform. and Control.

    Google Scholar 

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

    Google Scholar 

  49. Schützenberger M. P., Sur les relations rationnelles entre monol'des libres. Theor. Comput. Sci. 3 (1976), 243–259.

    Google Scholar 

  50. Schützenberger M. P., Sur les relations fonctionnelles. In: Automata Theory and Formal Languages, 2nd GI Conference (H. Brakhage ed.), Lect. Notes Comput. Sci. 33 (1975), 209–213.

    Google Scholar 

  51. Sénizergues G., Solution of a conjecture about rational subsets of the free group. Tech. Rep. Litp 86-3.

    Google Scholar 

  52. Ullman J., Principles of Database Systems, Computer Science Press, 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique Théorique et Programmation, Université Pierre et Marie Curie, Paris

    Jean Berstel & Jacques Sakarovitch

Authors
  1. Jean Berstel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacques Sakarovitch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berstel, J., Sakarovitch, J. (1986). Recent results in the theory of rational sets. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016231

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16783-9

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation