On the minimal number of \(\times\) operators to model regularity in fair SCCS (Q1122986)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the minimal number of \(\times\) operators to model regularity in fair SCCS |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the minimal number of \(\times\) operators to model regularity in fair SCCS |
scientific article |
Statements
On the minimal number of \(\times\) operators to model regularity in fair SCCS (English)
0 references
1988
0 references
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.
0 references
regular language
0 references
SCCS processes
0 references
