Nondeterministic Trajectories

  • Alexandru Mateescu
  • Arto Salomaa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2300)


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.


Regular Language Language Theory Parallel Composition Semantic Constraint Commutative Monoid 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 2.
    W. Kuich and A. Salomaa, Semirings, Automata, Languages, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1986.Google Scholar
  3. 3.
    A. Mateescu, “On (Left ) Partial Shuffle”, Results and Trends in Theoretical Computer Science, LNCS 812, Springer-Verlag, (1994) 264–278.Google Scholar
  4. 4.
    A. Mateescu and G.D. Mateescu, “Associative Closure and Periodicity of ω-words”, RAIRO, Informatique Theorique et Applications, 32, (1998) 153–174.MathSciNetGoogle Scholar
  5. 5.
    A. Mateescu, G. Rozenberg and A. Salomaa, “Shuffle on Trajectories: Syntactic Constraints”, Theoretical Computer Science, 197, (1998) 1–56. (Fundamental Study)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    G. Rozenberg and A. Salomaa (Eds.), Handbook of Formal Languages, Springer-Verlag, 1997, Vol. 1–3.Google Scholar
  7. 7.
    A. Salomaa, Formal Languages, Academic Press, New York, 1973.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Alexandru Mateescu
    • 1
  • Arto Salomaa
    • 2
  1. 1.Faculty of MathematicsUniversity of BucharestBucharestRomania
  2. 2.Turku Centre for Computer Science (TUCS)TurkuFinland

Personalised recommendations