Weighted register automata and weighted logic on data words
From MaRDI portal
Publication:3179411
Recommendations
Cites work
- scientific article; zbMATH DE number 1794360 (Why is no real title available?)
- scientific article; zbMATH DE number 1863168 (Why is no real title available?)
- A Nivat theorem for weighted timed automata and weighted relative distance logic
- A logical characterization of data languages.
- A theory of timed automata
- Alternating register automata on finite words and trees
- An automaton over data words that captures EMSO logic
- Event-clock automata: a determinizable class of timed automata
- Finite state machines for strings over infinite alphabets
- Finite-memory automata
- Handbook of weighted automata
- LTL with the freeze quantifier and register automata
- MSO logics for weighted timed automata
- Regular functions and cost register automata (invited paper)
- Relating timed and register automata
- Two-variable logic on data words
- Visibly pushdown languages
- Weak Second‐Order Arithmetic and Finite Automata
- Weighted automata and weighted logics
- Weighted versus Probabilistic Logics
Cited in
(7)- scientific article; zbMATH DE number 6987096 (Why is no real title available?)
- An automaton over data words that captures EMSO logic
- Weighted register automata and weighted logic on data words
- Weighted symbolic automata with data storage
- Optimal run problem for weighted register automata
- Optimal run problem for weighted register automata
- A taxonomy and reductions for common register automata formalisms
This page was built for publication: Weighted register automata and weighted logic on data words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179411)