On Associative Omega-Products

Authors:
Roman R. Redziejowski
Affiliations:
Ceremonimästarvägen 10, S-18140 Lidingö, Sweden
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)
Year:
2003

Citing 4
Cited 3

Infinite-word languages and continuous mappings

Theoretical Computer Science
An introduction to finite automata on infinite words

Automata on Infinite Words, Ecole de Printemps d'Informatique Théorique,
Positive Varieties and Infinite Words

LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
An Eilenberg Theorem for Infinity-Languages

ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming

Associative Omega-products of Traces

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Associative Omega-product of Processes

Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Infinite Product of Traces Represented by Projections

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.