On the minimal number of \(\times\) operators to model regularity in fair SCCS
type: Item
instance of: scholarly article
title: On the minimal number of \(\times\) operators to model regularity in fair SCCS
zbMATH Open document ID: 0676.68036
DOI: 10.1016/0020-0190(88)90228-1
author: Irène Guessarian
author: Lutz Priese
published in: Information Processing Letters
publication date: 1988-01-01T00:00:00Z
review text: Any \(\omega\)-regular language is a weakly, strongly or strictly fair language of some strict SCCS [\textit{R. Milner}, Calculi for synchrony and asynchrony, Theor. Comput. Sci. 25, 267-310 (1983; Zbl 0512.68026)] process that consists of a parallel product of exactly two inherently sequential SCCS processes.
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q70
zbMATH DE Number: 4108172
zbMATH Keywords: regular language
zbMATH Keywords: SCCS processes
reviewed by: Ryszard Janicki
MaRDI profile type: Publication
full work available at URL: 0020-0190(88)90228-1
OpenAlex ID: W2065362100
cites work: About fair asynchrony
cites work: Q3787456
cites work: Calculi for synchrony and asynchrony
cites work: An introduction to the regular theory of fairness
description: scientific article; zbMATH DE number 4108172