Abstract
We present structural properties of languages constructed with catenation and shuffle, comprising iteration lemmata and closure properties of the language classes, as well as decidability results that follow.
Get full access to this article
View all access options for this article.