A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Regular Cost Functions, Part I: Logic and Algebra over Words

2013
*
Logical Methods in Computer Science
*

The theory of regular cost functions is a quantitative extension to the classical notion of regularity. A cost function associates to each input a non-negative integer value (or infinity), as opposed to languages which only associate to each input the two values "inside" and "outside". This theory is a continuation of the works on distance automata and similar models. These models of automata have been successfully used for solving the star-height problem, the finite power property, the finite

doi:10.2168/lmcs-9(3:3)2013
fatcat:qn4wgvvrsjesricz6lddvgjwlm