Regular Functions and Cost Register Automata

Loading...
Thumbnail Image
Penn collection
Departmental Papers (CIS)
Degree type
Discipline
Subject
CPS Theory
deterministic automata
graph theory
cost function
cost register automata
deterministic model
min-cost problem
regular function
shortest-path algorithm
string-to-tree transducer
weighted automata
automata
commutation
computational modeling
cost function
grammar
registers
transducers
Computer Sciences
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
D'Antoni, Loris
Deshmukh, Jyotirmoy
Raghothaman, Mukund
Yuan, Yifei
Contributor
Abstract

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.

Advisor
Date of presentation
2013-01-01
Conference name
Departmental Papers (CIS)
Conference dates
2023-05-17T07:11:18.000
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
The conference was held June 25-28, 2013, in New Orleans, LA.
Recommended citation
@INPROCEEDINGS{6571532, author={Alur, R. and D'Antoni, L. and Deshmukh, J. and Raghothaman, M. and Yifei Yuan}, booktitle={Logic in Computer Science (LICS), 2013 28th Annual IEEE/ACM Symposium on}, title={Regular Functions and Cost Register Automata}, year={2013}, month={June}, pages={13-22}, keywords={deterministic automata;graph theory;cost function;cost register automata;deterministic model;min-cost problem;regular function;shortest-path algorithm;string-to-tree transducer;weighted automata;Automata;Commutation;Computational modeling;Cost function;Grammar;Registers;Transducers}, doi={10.1109/LICS.2013.65}, ISSN={1043-6871},}
Collection