Abstract
Shuffle of formal languages and its properties are considered. An application of some results of the shuffle theory to decidability of deadlock and fairness problem in parallel systems is shown.
Get full access to this article
View all access options for this article.