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

@article{Colcombet2012RegularCF,
  title={Regular Cost Functions, Part I: Logic and Algebra over Words},
  author={Thomas Colcombet},
  journal={Logical Methods in Computer Science},
  year={2012},
  volume={9}
}
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… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

References

Publications referenced by this paper.
Showing 1-10 of 45 references

Factorization Forests of Finite Height

Theor. Comput. Sci. • 1990
View 10 Excerpts
Highly Influenced

On the topological structure of a finitely generated semigroup of matrices

Hing Leung
Semigroup Forum, • 1988
View 7 Excerpts
Highly Influenced

An Algebraic Method for Solving Decision Problems in Finite Automata Theory

Hing Leung
PhD thesis, • 1987
View 7 Excerpts
Highly Influenced

A Decision Procedure for the Order of Regular Events

Theor. Comput. Sci. • 1979
View 10 Excerpts
Highly Influenced

Limited subsets of a free monoid

19th Annual Symposium on Foundations of Computer Science (sfcs 1978) • 1978
View 11 Excerpts
Highly Influenced

Regular Cost Functions over Finite Trees

2010 25th Annual IEEE Symposium on Logic in Computer Science • 2010
View 2 Excerpts

Similar Papers

Loading similar papers…