Regular Functions and Cost Register Automata

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 resultin...

Full description

Saved in:
Bibliographic Details
Published in:2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 13 - 22
Main Authors: Alur, Rajeev, D'Antoni, Loris, Deshmukh, Jyotirmoy, Raghothaman, Mukund, Yifei Yuan
Format: Conference Proceeding
Language:English
Published: IEEE 01.06.2013
Subjects:
Automata
Commutation
Computational modeling
Cost function
Grammar
Registers
Transducers
ISBN:1479904139, 9781479904136
ISSN:1043-6871
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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.
AbstractList 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.
Author Raghothaman, Mukund
Deshmukh, Jyotirmoy
Alur, Rajeev
Yifei Yuan
D'Antoni, Loris
Author_xml – sequence: 1
  givenname: Rajeev
  surname: Alur
  fullname: Alur, Rajeev
– sequence: 2
  givenname: Loris
  surname: D'Antoni
  fullname: D'Antoni, Loris
– sequence: 3
  givenname: Jyotirmoy
  surname: Deshmukh
  fullname: Deshmukh, Jyotirmoy
– sequence: 4
  givenname: Mukund
  surname: Raghothaman
  fullname: Raghothaman, Mukund
– sequence: 5
  surname: Yifei Yuan
  fullname: Yifei Yuan
BookMark eNotjE1LxDAUAAOu4Hb15s1Lf4Ct7yVp2hyX4upCQfDjvLwmr1LZTaVJD_57F_QwzGFgMrEKU2AhbhFKRLAP3b59KyWgKk11ITLUtbWgUdmVWCNoVZimxiuRxfgFANJoWIv7V_5cjjTnuyW4NE4h5hR83k4x5ec0xsRzvl3SdKJE1-JyoGPkm39vxMfu8b19LrqXp3277QqSGlPhFaOXkhGG3oM5Q9ygaXo3yIqQdU3WMXvfwCB7Qj0Y3aPq2RklnQS1EXd_35GZD9_zeKL552CqGisl1S-WAUL5
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/LICS.2013.65
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 22
ExternalDocumentID 6571532
Genre orig-research
GroupedDBID --Z
23M
29P
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-a241t-d3e1d22e10fbd06bd0ae8168bcf25a1e47a9ceedd80f2ba14f64b13bec632c203
IEDL.DBID RIE
ISBN 1479904139
9781479904136
ISICitedReferencesCount 51
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000326815000005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1043-6871
IngestDate Wed Aug 27 04:17:06 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a241t-d3e1d22e10fbd06bd0ae8168bcf25a1e47a9ceedd80f2ba14f64b13bec632c203
PageCount 10
ParticipantIDs ieee_primary_6571532
PublicationCentury 2000
PublicationDate 2013-June
PublicationDateYYYYMMDD 2013-06-01
PublicationDate_xml – month: 06
  year: 2013
  text: 2013-June
PublicationDecade 2010
PublicationTitle 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
PublicationTitleAbbrev lics
PublicationYear 2013
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002640
ssj0001035133
Score 2.2236805
Snippet We propose a deterministic model for associating costs with strings that is parameterized by operations of interest (such as addition, scaling, and minimum), a...
SourceID ieee
SourceType Publisher
StartPage 13
SubjectTerms Automata
Commutation
Computational modeling
Cost function
Grammar
Registers
Transducers
Title Regular Functions and Cost Register Automata
URI https://ieeexplore.ieee.org/document/6571532
WOSCitedRecordID wos000326815000005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07b8IwELYo6tCJtlD1LQ8dMcR24sRjhYpaqUKoD4kN-XGWuiRVCP392CZAhy4dIjnxYuty9yXnu-9D6EG5IhSseUdiyoRsFSeFLoAAl04HCrQMXBSbyGezYrGQ8w4a7nthACAWn8EoDONZvq3MOqTKxiLLvYP6gHuU52Lbq3XIp4QjMX6Iwh7oWyYCToT_K4hNXbmPvT5qyx3XU3sv9hXxcvz6MnkPFV98FPDml-JKBJxp739LPUWDQ-cenu8x6Qx1oDxHvZ10A249uY-Gb1GDvsZTj2vx1cOqtHhSrRrsp4Lta_y4bir_QasG6HP69DF5Jq1wAlEekBtiOVDLGNDEaZsIfykI-hraOJYpCmmuZFiILRLHtKKpE6mm3JtTcGZYwi9Qt6xKuETY2SwQ8MjCOJuq1CljdCo5t4wCd9ZeoX7Y_PJ7y42xbPd9_ffjG3TCtnISJKG3qNvUa7hDx-an-VrV99GgG1g7mrg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09b8IwED0hWqmdaAtVv-uhI4HEdr7GChWBShFqqcSGHPssdUlQCP39tU2ADl06RHLixdbl7iXnu_cAnoRObMGacSQqpM1WMS_JEvSQpTqzFGghaic2EU-nyWKRzhrQ3ffCIKIrPsOeHbqzfFXIjU2V9aMwNg5qAu5RyDn1t91ah4yKPRRjhzhsoL7mImBeZP4LXFtXbKKvidvpju2pvo_2NfFpfzIefNiaL9aziPNLc8VBzrD1v8WeQefQu0dme1Q6hwbmF9DaiTeQ2pfb0H13KvQlGRpkcy8fEbkig2JdETNlrV-S501VmE9a0YHP4ct8MPJq6QRPGEiuPMUwUJRi4OtM-ZG5BFqFjUxqGooAeSxSuxCV-JpmIuA64lnAjEEjRiX12SU08yLHKyBahZaCJ02kVlxwLaTMeMqYogEyrdQ1tO3ml6stO8ay3vfN348f4WQ0f5ssJ-Pp6y2c0q24hOcHd9Csyg3ew7H8rr7W5YMz7g-cTJ3_
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2013+28th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=Regular+Functions+and+Cost+Register+Automata&rft.au=Alur%2C+Rajeev&rft.au=D%27Antoni%2C+Loris&rft.au=Deshmukh%2C+Jyotirmoy&rft.au=Raghothaman%2C+Mukund&rft.date=2013-06-01&rft.pub=IEEE&rft.isbn=9781479904136&rft.issn=1043-6871&rft.spage=13&rft.epage=22&rft_id=info:doi/10.1109%2FLICS.2013.65&rft.externalDocID=6571532
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1043-6871&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1043-6871&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1043-6871&client=summon