A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties
From MaRDI portal
Publication:1797777
DOI10.1007/s00500-015-1952-6zbMath1398.03157OpenAlexW2204174169MaRDI QIDQ1797777
Publication date: 22 October 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-015-1952-6
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)
Related Items (7)
Weighted Linear Dynamic Logic ⋮ Quantitative vs. weighted automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Weighted Automata and Logics on Infinite Graphs ⋮ Weighted operator precedence languages
Cites Work
- Multi-weighted automata and MSO logic
- A Büchi-like theorem for weighted tree automata over multioperator monoids
- Handbook of weighted automata
- Weighted tree automata and weighted logics
- Weighted automata and weighted MSO logics for average and long-time behaviors
- Weighted automata and weighted logics
- Weighted logics for unranked tree automata
- Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics
- Logics for Weighted Timed Pushdown Automata
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- Weak Second‐Order Arithmetic and Finite Automata
- On the definition of a family of automata
- Weighted versus Probabilistic Logics
- Decision Problems of Finite Automata Design and Related Arithmetics
- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic
- Generalized finite automata theory with an application to a decision problem of second-order logic
This page was built for publication: A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties
