On the minimal number of \(\times\) operators to model regularity in fair SCCS
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.
scientific article; zbMATH DE number 4108172