Algorithms for determining relative star height and star height
Information and Computation
Improved limitedness theorems on finite automata with distance functions
Theoretical Computer Science - Special issue on theoretical computer science, algebra and combinatorics
Limitedness theorem on finite automata with distance functions: an algebraic proof
Theoretical Computer Science
Finite-valued distance automata
Selected papers of the second international colloquium on Words, languages and combinatorics
Recognizable Sets with Multiplicities in the Tropical Semiring
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
The limitedness problem on distance automata: Hashiguchi's method revisited
Theoretical Computer Science
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Limited subsets of a free monoid
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Boundedness of Monadic Second-Order Formulae over Finite Words
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Regular temporal cost functions
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Some variants of the star height problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Weak cost monadic logic over infinite trees
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On the expressive power of cost logics over infinite words
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Languages of profinite words and the limitedness problem
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Nondeterminism in the presence of a diverse or unknown future
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Quantitative reactive modeling and verification
Computer Science - Research and Development
Regular Functions and Cost Register Automata
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
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.