Abstract

We consider a first-order logic, a linear temporal logic, star-free expressions and counter-free Büchi automata, with weights, over idempotent, zerodivisor free and totally commutative complete semirings. We show the expressive equivalence (of fragments) of these concepts, generalizing in the quantitative setup, the corresponding folklore result of formal language theory.

Full Text
Published version (Free)

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 call