Regular Functions and Cost Register Automata

DOI10.1109/LICS.2013.65zbMath1366.68046MaRDI QIDQ5271036

Jyotirmoy V. Deshmukh, Mukund Raghothaman, Loris D'Antoni, Yifei Yuan, Rajeev Alur

Publication date: 3 July 2017

Published in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Related Items (26)

Unnamed Item ⋮ Weighted Register Automata and Weighted Logic on Data Words ⋮ Counter machines and distributed automata -- a story about exchanging space and time ⋮ Complexity of regular functions ⋮ A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings ⋮ Deriving generic bounds for time-series constraints based on regular expressions characteristics ⋮ Degree of Sequentiality of Weighted Automata ⋮ Quantitative Automata under Probabilistic Semantics ⋮ Copyless cost-register automata: structure, expressiveness, and closure properties ⋮ Better complexity bounds for cost register automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Weighted register automata and weighted logic on data words ⋮ Streamable regular transductions ⋮ Regular Programming for Quantitative Properties of Data Streams ⋮ On deterministic weighted automata ⋮ Optimal run problem for weighted register automata ⋮ Cost Register Automata for Nested Words ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs ⋮ Copyful Streaming String Transducers ⋮ Bidirectional nested weighted automata ⋮ Weak Cost Register Automata are Still Powerful ⋮ Better complexity bounds for cost register automata ⋮ A robust class of linear recurrence sequences

This page was built for publication: Regular Functions and Cost Register Automata