Weighted register automata and weighted logic on data words
From MaRDI portal
Publication:1786559
DOI10.1016/j.tcs.2018.01.004zbMath1400.68097OpenAlexW2783604862MaRDI QIDQ1786559
Manfred Droste, Vitaly Perevoshchikov, Parvaneh Babari
Publication date: 24 September 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.01.004
data languagesweighted MSO logicdata seriesdeterminizable class of register automataweighted register automata
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items
Decidability of the minimization of fuzzy tree automata with membership values in complete lattices, Unnamed Item, Optimal run problem for weighted register automata, Weighted automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- MSO logics for weighted timed automata
- Weighted automata and multi-valued logics over arbitrary bounded lattices
- 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
- Optimal infinite scheduling for multi-priced timed automata
- Alternating register automata on finite words and trees
- LTL with the freeze quantifier and register automata
- Two-variable logic on data words
- On the Use of Guards for Logics with Data
- An Automaton over Data Words That Captures EMSO Logic
- Energy Games in Multiweighted Automata
- Weighted Register Automata and Weighted Logic on Data Words
- Weak Second‐Order Arithmetic and Finite Automata
- Quantitative Languages
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Visibly pushdown languages
- Weighted versus Probabilistic Logics
- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
- Discount-Optimal Infinite Runs in Priced Timed Automata
- Regular Functions and Cost Register Automata
- Finite state machines for strings over infinite alphabets
