Infinite-word languages and continuous mappings
Theoretical Computer Science
An Eilenberg theorem for ∞ -languages
Proceedings of the 18th international colloquium on Automata, languages and programming
An introduction to finite automata on infinite words
Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique,
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Positive Varieties and Infinite Words
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Associative Omega-product of Processes
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Associative Omega-products of Traces
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Hi-index | 0.00 |
In recent years, a number of classical results connecting rational languages with finite semigroups have been extended to infinite-word languages using the notion of an ω-semigroup: a semigroup augmented with an associative infinite product. This paper takes a closer look at the associative infinite product itself. It suggests some improvements and presents a couple of new facts.