2013/07/02 by Manfred Droste, M. Droste, Droste, M. +6
Computer Science · #68Q70 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic, programming, and type systems #Natural Language Processing Techniques #cs.FL #msc:68Q70 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1307.0725
openalex publication_date 2013/07/02 · arxiv created 2013/07/31 · arxiv updated 2013/08/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.