Skip to main content
SpringerLink
Log in

On recognizable subsets of free partially commutative monoids

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1986)

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

Included in the following conference series:

Résumé

On montre que dans un monoīde partiellement commutatif libre, engendré par un alphabet fini A, le sous-ensemble [X] de A* formé des mots équivalents à un des mots de X est reconnaissable si X est reconnaissable et si tout facteur itérant de X a un graphe de non-commutation connexe.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I.J.J.AALBERSBERG, G.ROZENBERG, Trace Theory — a survey, Technical report, Inst. of Appl. Math. and Comp. Sci., University of Leiden, (1985).

    Google Scholar 

  2. A.V.ANISIMOV, D.KNUTH, Inhomogeneous sorting, unpublished manuscript.

    Google Scholar 

  3. J.BERSTEL, Transductions and Context-Free Languages. Teubner, (1979).

    Google Scholar 

  4. A.BERTONI, G.MAURI and N.SABADINI, equivalence and membership problems for regular trace languages, Proc. of the 9th ICALP 1982, Lecture Notes in Computer Sci. 140, Springer, (1982), 61–71.

    Google Scholar 

  5. P. CARTIER et D. FOATA, Problèmes combinatoires de commutation et de réarrangements, in: Lecture Notes in Mathematics 85, (Springer, Berlin, 1969).

    Google Scholar 

  6. R. CORI et D. PERRIN, sur la reconnaissabilité dans les monoīdes partiellement commutatifs libres, RAIRO Inform. Théor. vol. 19, (1985), 21–32.

    Google Scholar 

  7. R. CORI et Y. METIVIER, Recognizable subsets of partially abelian monoids, Theoret. Comput. Sci. 35, (1985), 179–189.

    Google Scholar 

  8. M.P. FLE and G. ROUCAIROL, Maximal serializability of iterated transactions, Theoret. Comput. Sci. 38, (1985),1–16.

    Google Scholar 

  9. M. LOTHAIRE, Combinatorics on Words (Addison-Wesley, Reading MA, 1983).

    Google Scholar 

  10. R.Mc NAUGHTON and H.YAMADA, Regular expressions and state graphs for automata, IRE Trans. On Electric Computers, EC-9 (1960).

    Google Scholar 

  11. Y.METIVIER, Une condition suffisante de reconnaissabilité dans un monoīde partiellement commutatif, (soumis à RAIRO Inform. Théo.).

    Google Scholar 

  12. D.PERRIN, Words over a partially commutative alphabet, in: Combinatorial Algorithms on Words, Ed.: A. Apostolico and Z. Galil, NATO ASI-Series. Vol. F12, Springer, (1985).

    Google Scholar 

  13. E.OCHMANSKI, Regular behaviour of concurrent systems, in:EATCS Bulletin, (October 1985).

    Google Scholar 

  14. G.VIENNOT, Empilement et commutation: théorie combinatoire et applications, Proc. Colloque de combinatoire énumérative, Montréal 1985, à paraître Lecture Notes in Math.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. U.E.R. de Mathématiques et d'Informatique, Université de Bordeaux I, 345, Cours de la Libération, 33405, Talence, France

    Y. Metivier

Authors
  1. Y. Metivier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Laurent Kott

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Metivier, Y. (1986). On recognizable subsets of free partially commutative monoids. In: Kott, L. (eds) Automata, Languages and Programming. ICALP 1986. Lecture Notes in Computer Science, vol 226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_75

Download citation

  • DOI: https://doi.org/10.1007/3-540-16761-7_75

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16761-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation