Properties of Languages with Catenation and Shuffle

Abstract. We present finite automata for shuffle languages, iteration lemmata for languages with catenation and shuffle, closure properties of such language classes, as well as decidability results