Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

On aperiodic trace languages

  • Trace Theory
  • Conference paper
  • First Online:
STACS 91 (STACS 1991)

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

Included in the following conference series:

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. Aalbersberg, G. Rozenberg, Theory of traces, Theoret. Comput. Sci., 60 (1988), 1–82.

    Article  Google Scholar 

  2. C. Choffrut, Free partially commutative monoids, Report LITP 86.20 (1986).

    Google Scholar 

  3. C. Duboc, Commutations dans les monoides libres: un cadre theorique pour l'etude du parallelisme, These (1986) Rouen Univ. France.

    Google Scholar 

  4. S. Eilenberg, Automata, languages and machines, Academic Press, Vol. A (1974); Vol. B (1976).

    Google Scholar 

  5. G.Guaiana, A.Restivo, S.Salemi, Star-free trace languages, Report LITP 90.60, Juillet 1990.

    Google Scholar 

  6. R. McNaughton, S. Papert, Counter-Free Automata, M.I.T. Press (1971).

    Google Scholar 

  7. D. Perrin, Partial commutations, ICALP 89, L.N.C.S. 372 (1989), 637–651.

    Google Scholar 

  8. D. Perrin, Finite automata, Report LITP 89-26 (1989), to appear in Handbook of Theoretical Computer Science.

    Google Scholar 

  9. J. F. Perrot, Varietes de langages et operations. Theoretical Computer Science, 7 (1978), 197–210.

    Article  Google Scholar 

  10. J. E. Pin, Varieties of formal languages, North Oxford Academic, London (1986).

    Google Scholar 

  11. M. P. Schutzenberger, On finite monoids having only trivial subgroups, Information and Control, 8 (1965), 190–194.

    Article  Google Scholar 

  12. M. P. Schutzenberger, Sur certaines pseudo-varietes de monoides finis, Report IRIA-Laboria N.62 (1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Applicazioni, Università di Palermo, Via Archirafi, 34, I - 90123, Palermo, Italy

    G. Guaiana, A. Restivo & S. Salemi

Authors
  1. G. Guaiana
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Restivo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Salemi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Choffrut Matthias Jantzen

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guaiana, G., Restivo, A., Salemi, S. (1991). On aperiodic trace languages. In: Choffrut, C., Jantzen, M. (eds) STACS 91. STACS 1991. Lecture Notes in Computer Science, vol 480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020789

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53709-0

  • Online ISBN: 978-3-540-47002-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation