Continuous monoids and semirings

Authors:
Georg Karner
Affiliations:
Alcatel Austria, Scheydgasse 41, A-1211 Vienna, Austria
Venue:
Theoretical Computer Science - Logic, semantics and theory of programming
Year:
2004

Citing 4
Cited 3

Kleene's theorem revisited

Proceedings of the th International Meeting of Young Computer Scientists on Trends, Techniques, and Problems in Theoretical Computer Science
A Topology for Complete Semirings

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Formal tree series

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Inductive *-semirings

Theoretical Computer Science - Words, languages and combinatorics

Simulations of weighted tree automata

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Weighted Extended Tree Transducers

Fundamenta Informaticae
Preservation of recognizability for weighted linear extended top-down tree transducers

ATANLP '12 Proceedings of the Workshop on Applications of Tree Automata Techniques in Natural Language Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Different kinds of monoids and semirings have been defined in the literature, all of them named "continuous". We show their relations. The main technical tools are suitable topologies, among others a variant of the well-known Scott topology for complete partial orders.