Langages infinitaires et produit de mixage
type: Item
instance of: scholarly article
title: Langages infinitaires et produit de mixage
zbMATH Open document ID: 0571.68064
DOI: 10.1016/0304-3975(84)90128-2
published in: Theoretical Computer Science
publication date: 1984-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 3911739
zbMATH Keywords: synchronization
zbMATH Keywords: parallel computing
zbMATH Keywords: shuffle product
zbMATH Keywords: infinitary languages
zbMATH Keywords: rational languages
zbMATH Keywords: COSY programs
author: Robert de Simone
reviewed by: Manfred Armbrust
describes a project that uses: COSY
MaRDI profile type: Publication
full work available at URL: 0304-3975(84)90128-2
OpenAlex ID: W1975460338
cites work: Q3890123
cites work: Adherences of languages
cites work: Q5525343
cites work: Q4079524
cites work: Q4845486
cites work: Q4140399
cites work: COSY - a system specification language based on paths and processes
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Q4147597
description: scientific article; zbMATH DE number 3911739