Linear Temporal Logic for Regular Cost Functions
Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties. The specificity of cost functions is that exact values are not considered, but only estimated. I...
Main Author: | Denis Kuperberg |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2014-02-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/1222/pdf |
Similar Items
-
Positive First-order Logic on Words and Graphs
by: Denis Kuperberg
Published: (2023-07-01) -
Separating Regular Languages with First-Order Logic
by: Thomas Place, et al.
Published: (2016-03-01) -
Regular Cost Functions, Part I: Logic and Algebra over Words
by: Thomas Colcombet
Published: (2013-08-01) -
Effective Characterizations of Simple Fragments of Temporal Logic Using Carton--Michel Automata
by: Preugschat Sebastian, et al.
Published: (2013-06-01) -
Synthesis of Computable Regular Functions of Infinite Words
by: V. Dave, et al.
Published: (2022-06-01)