Skip to main content
SpringerLink
Log in

Nondeterministic Trajectories

  • Chapter
  • First Online:
Formal and Natural Computing

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

Abstract

Trajectories have been introduced as mechanisms to control the shuffle operation, traditionally important in the study of parallelism and concurrency. A variant, nondeterministic trajectory will be introduced in this paper. It provides more leeway in the control of the shuffle operation. Ordinary trajectories will be obtained as a special case of nondeterministic ones. The paper investigates basic properties of nondeterministic trajectories, emphasizing algebraic aspects, interconnections with language theory and the property of fairness.

The first author was partially supported by Direcció General de Recerca, Generalitat de Catalunya (programme PIV)

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.S. Golan, The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science, Longman Scientific and Technical, Harlow, Essex, 1992.

    Google Scholar 

  2. W. Kuich and A. Salomaa, Semirings, Automata, Languages, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1986.

    Google Scholar 

  3. A. Mateescu, “On (Left ) Partial Shuffle”, Results and Trends in Theoretical Computer Science, LNCS 812, Springer-Verlag, (1994) 264–278.

    Google Scholar 

  4. A. Mateescu and G.D. Mateescu, “Associative Closure and Periodicity of ω-words”, RAIRO, Informatique Theorique et Applications, 32, (1998) 153–174.

    MathSciNet  Google Scholar 

  5. A. Mateescu, G. Rozenberg and A. Salomaa, “Shuffle on Trajectories: Syntactic Constraints”, Theoretical Computer Science, 197, (1998) 1–56. (Fundamental Study)

    Article  MATH  MathSciNet  Google Scholar 

  6. G. Rozenberg and A. Salomaa (Eds.), Handbook of Formal Languages, Springer-Verlag, 1997, Vol. 1–3.

    Google Scholar 

  7. A. Salomaa, Formal Languages, Academic Press, New York, 1973.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, University of Bucharest, Academiei, 14, Bucharest, Romania

    Alexandru Mateescu

  2. Turku Centre for Computer Science (TUCS), Lemminkäisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Authors
  1. Alexandru Mateescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arto Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Technical University of Munich, Arcisstraße 21, 80333, Munich, Germany

    Wilfried Brauer

  2. Computer Science Department, Technical University of Berlin, Franklinstraße 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  3. Department of Mathematics, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  4. Turku Centre for Computer Science, Lemminkäisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Mateescu, A., Salomaa, A. (2002). Nondeterministic Trajectories. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds) Formal and Natural Computing. Lecture Notes in Computer Science, vol 2300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45711-9_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-45711-9_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation