Abstract
We introduce the notion of regular cost functions: a quantitative extension to the standard theory of regular languages. We provide equivalent characterisations of this notion by means of automata (extending the nested distance desert automata of Kirsten), of history-deterministic automata (history-determinism is a weakening of the standard notion of determinism, that replaces it in this context), and a suitable notion of recognisability by stabilisation monoids. We also provide closure and decidability results. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Colcombet, T. (2009). The theory of stabilisation monoids and regular cost functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5556 LNCS, pp. 139–150). https://doi.org/10.1007/978-3-642-02930-1_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
