Conway and iteration hemirings
Formal Languages and Automata Theory
2013-08-01 v2
Abstract
Conway hemirings are Conway semirings without a multiplicative unit. We also define iteration hemirings as Conway hemirings satisfying certain identities associated with the finite groups. Iteration hemirings are iteration semirings without a multiplicative unit. We provide an analysis of the relationship between Conway hemirings and (partial) Conway semirings and describe several free constructions. In the second part of the paper we define and study hemimodules of Conway and iteration hemirings, and show their applicability in the analysis of quantitative aspects of the infinitary behavior of weighted transition systems. These include discounted and average computations of weights.
Cite
@article{arxiv.1307.0725,
title = {Conway and iteration hemirings},
author = {M. Droste and Z. Esik and W. Kuich},
journal= {arXiv preprint arXiv:1307.0725},
year = {2013}
}