Theoretical Computer Science
Finite-valued distance automata
Selected papers of the second international colloquium on Words, languages and combinatorics
Combinatorial approximation algorithms for generalized flow problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Macro tree transducers, attribute grammars, and MSO definable tree translations
Information and Computation
The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Combinatorial algorithms for the generalized circulation problem
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
The Theory of Stabilisation Monoids and Regular Cost Functions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Weighted automata and weighted logics with discounting
Theoretical Computer Science
Handbook of Weighted Automata
On notions of regularity for data languages
Theoretical Computer Science
Reasoning about online algorithms with weighted automata
ACM Transactions on Algorithms (TALG)
ACM Transactions on Computational Logic (TOCL)
Regular Cost Functions over Finite Trees
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Streaming transducers for algorithmic verification of single-pass list-processing programs
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Foundations of XML Processing: The Tree-Automata Approach
Foundations of XML Processing: The Tree-Automata Approach
What's decidable about weighted automata?
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Weighted automata and weighted logics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
From Monadic Second-Order Definable String Transformations to Transducers
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
We propose a deterministic model for associating costs with strings that is parameterized by operations of interest (such as addition, scaling, and minimum), a notion of regularity that provides a yardstick to measure expressiveness, and study decision problems and theoretical properties of resulting classes of cost functions. Our definition of regularity relies on the theory of string-to-tree transducers, and allows associating costs with events that are conditioned on regular properties of future events. Our model of cost register automata allows computation of regular functions using multiple "write-only" registers whose values can be combined using the allowed set of operations. We show that the classical shortest-path algorithms as well as the algorithms designed for computing discounted costs can be adapted for solving the min-cost problems for the more general classes of functions specified in our model. Cost register automata with the operations of minimum and increment give a deterministic model that is equivalent to weighted automata, an extensively studied nondeterministic model, and this connection results in new insights and new open problems.