Langages infinitaires et produit de mixage
With the modeling of parallel process behaviour in mind, the author investigates a particular shuffle product of infinitary languages which seems to have been proposed by \textit{T. Kimura} [Proc. 8th ann. ACM Symp. Theor. Comput., Hershey 1976, 92-100 (1976; Zbl 0365.68066)]: The product of \(L_ 1\) and \(L_ 2\) consists of all finite or infinite words w of letters actually occurring in \(L_ 1\) or in \(L_ 2\) such that the substring of w formed by the letters from \(L_ i\) belongs to \(L_ i\) for \(i=1\), 2. Among other things, it is shown that the product of rational languages is again rational. It is indicated how the product can be used to represent COSY programs by single rational expressions.
scientific article; zbMATH DE number 3911739