Abstract
Quantitative automata computing the maximal average consumption of resources are currently intensively investigated. We introduce Conway hemirings and show that a few equational axioms suffice to imply a Kleene theorem for the possible behaviors of quantitative automata characterizing them as rational series, and we derive several further natural identities for rational operations on such series. We also obtain a more abstract Kleene theorem for Conway hemiring automata. This extends classical results of Conway and Schützenberger for recognizable languages resp. semiring-weighted automata.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
