Nondeterministic Trajectories

Authors:
Alexandru Mateescu;Arto Salomaa
Affiliations:
-;-
Venue:
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Year:
2002

Citing 6
Cited 1

Semirings, automata, languages

Semirings, automata, languages
Formal languages

Formal languages
The theory of semirings with applications in mathematics and theoretical computer science

The theory of semirings with applications in mathematics and theoretical computer science
Shuffle on trajectories: syntactic constraints

Theoretical Computer Science
Handbook of Formal Languages

Handbook of Formal Languages
On (Left) Partial Shuffle

Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science

Aspects of shuffle and deletion on trajectories

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.