Weighted register automata and weighted logic on data words
type: Item
instance of: scholarly article
title: Weighted register automata and weighted logic on data words
zbMATH Open document ID: 1400.68097
author: Parvaneh Babari
author: Manfred Droste
author: Vitaly Perevoshchikov
published in: Theoretical Computer Science
publication date: 2018-09-24T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03D05
zbMATH DE Number: 6942947
zbMATH Keywords: weighted register automata
zbMATH Keywords: data languages
zbMATH Keywords: data series
zbMATH Keywords: weighted MSO logic
zbMATH Keywords: determinizable class of register automata
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.01.004
OpenAlex ID: W2783604862
cites work: Regular Functions and Cost Register Automata
cites work: A theory of timed automata
cites work: Event-clock automata: a determinizable class of timed automata
cites work: Visibly pushdown languages
cites work: Q4552456
cites work: Weighted Register Automata and Weighted Logic on Data Words
cites work: Q4552463
cites work: Two-variable logic on data words
cites work: An Automaton over Data Words That Captures EMSO Logic
cites work: Weighted versus Probabilistic Logics
cites work: A logical characterization of data languages.
cites work: Optimal infinite scheduling for multi-priced timed automata
cites work: Infinite Runs in Weighted Timed Automata with Energy Constraints
cites work: Q4791839
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Quantitative Languages
cites work: On the Use of Guards for Logics with Data
cites work: Weighted automata and weighted logics
cites work: Handbook of weighted automata
cites work: A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
cites work: Weighted automata and multi-valued logics over arbitrary bounded lattices
cites work: LTL with the freeze quantifier and register automata
cites work: Energy Games in Multiweighted Automata
cites work: Discount-Optimal Infinite Runs in Priced Timed Automata
cites work: Alternating register automata on finite words and trees
cites work: Q4963999
cites work: Finite-memory automata
cites work: Finite state machines for strings over infinite alphabets
cites work: Q3574978
cites work: MSO logics for weighted timed automata
DOI: 10.1016/J.TCS.2018.01.004
description: scientific article; zbMATH DE number 6942947