Weighted Register Automata and Weighted Logic on Data Words

DOI10.1007/978-3-319-46750-4_21zbMath1482.68124OpenAlexW2523048084MaRDI QIDQ3179411

Parvaneh Babari, Vitaly Perevoshchikov, Manfred Droste

Publication date: 21 December 2016

Published in: Theoretical Aspects of Computing – ICTAC 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-46750-4_21

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (4)

A taxonomy and reductions for common register automata formalisms ⋮ Unnamed Item ⋮ Weighted register automata and weighted logic on data words ⋮ Optimal run problem for weighted register automata

Cites Work

• Unnamed Item
• Unnamed Item
• MSO logics for weighted timed automata
• Handbook of weighted automata
• Event-clock automata: a determinizable class of timed automata
• A theory of timed automata
• Finite-memory automata
• A logical characterization of data languages.
• Weighted automata and weighted logics
• Alternating register automata on finite words and trees
• LTL with the freeze quantifier and register automata
• Two-variable logic on data words
• Relating timed and register automata
• An Automaton over Data Words That Captures EMSO Logic
• Weak Second‐Order Arithmetic and Finite Automata
• Visibly pushdown languages
• Weighted versus Probabilistic Logics
• A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
• Regular Functions and Cost Register Automata
• Finite state machines for strings over infinite alphabets

This page was built for publication: Weighted Register Automata and Weighted Logic on Data Words