|
Journal of Automata, Languages and Combinatorics
formerly:
Journal of Information Processing and Cybernetics /
Elektronische Informationsverarbeitung und Kybernetik
|
|
@article{jalc050204,
author = {Mateescu, Alexandru and Salomaa, Kai and Yu, Sheng},
title = {On Fairness of Many-Dimensional Trajectories},
journal = jalc,
year = 2000,
volume = 5,
number = 2,
pages = {145--157},
keywords = {fairness, trajectories, shuffle},
abstract = {Many-dimensional trajectories provide a method to define
and to investigate the parallel composition of $k$ words or
languages, where $k\geq 2$. We introduce natural fairness
conditions for the shuffle operation defined by a set of
many-dimensional trajectories. The decidability of the
fairness property for context-free sets of many-dimensional
trajectories is investigated. We show that both, the weak
and the strong problem to decide the fairness property for
context-free sets of many-dimensional trajectories are
decidable. Finally, we prove that the initial fairness
problem is also decidable for context-free sets of
many-dimensional trajectories.}
}