Quantitative vs. weighted automata
From MaRDI portal
Publication:2695484
Recommendations
- Weighted automata
- Quantum finite automata and weighted automata
- Weighted automata and weighted logics
- Weighted automata and weighted logics
- Automata, Languages and Programming
- Weighted automata algorithms
- On computational power of weighted finite automata
- scientific article; zbMATH DE number 871243
- On deterministic weighted automata
- Quasi-distances and weighted finite automata
Cites work
- scientific article; zbMATH DE number 3983141 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 2038728 (Why is no real title available?)
- scientific article; zbMATH DE number 1405651 (Why is no real title available?)
- scientific article; zbMATH DE number 7354705 (Why is no real title available?)
- scientific article; zbMATH DE number 7561720 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- scientific article; zbMATH DE number 7649927 (Why is no real title available?)
- A combinatorial approach to the theory of ω-automata
- A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties
- Alternating Pushdown and Stack Automata
- Alternating Weighted Automata
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
- Alternating weighted automata over commutative semirings
- Alternation
- An approximate determinization algorithm for weighted finite-state automata
- Application of model theoretic games to discrete linear orders and finite automata
- Approximate determinization of quantitative automata
- Automata theory and model checking
- Averaging in LTL
- Better Quality in Synthesis through Quantitative Objectives
- Decision Problems of Finite Automata Design and Related Arithmetics
- Describing average- and longtime-behavior by weighted MSO logics
- Discounting in LTL
- Exact and approximate determinization of discounted-sum automata
- Finite Automata Computing Real Functions
- First-order definable languages
- First-order logic and star-free sets
- Formally reasoning about quality
- Max and sum semantics for alternating weighted automata
- Model Checking Quantitative Linear Time Logic
- Nested weighted automata
- Non-zero sum games for reactive synthesis
- On delay and regret determinization of max-plus automata
- On finite monoids having only trivial subgroups
- On the definition of a family of automata
- Probabilistic automata
- QUASY: quantitative synthesis tool
- Quantitative Languages
- Quantitative assume guarantee synthesis
- Quantitative languages
- Quantitative languages defined by functional automata
- Reactive synthesis without regret
- Reasoning about online algorithms with weighted automata
- Rigorous approximated determinization of weighted automata
- Solving Games Without Determinization
- Star-free regular sets of ω-sequences
- Temporal specifications with accumulative values
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Universal graphs and good for games automata: new tools for infinite duration games
- Weighted Automata and Weighted Logics on Infinite Words
- Weighted LTL with discounting
- Weighted automata and weighted MSO logics for average and long-time behaviors
- Weighted automata and weighted logics
- Weighted automata on infinite words in the context of attacker-defender games
- What's decidable about weighted automata?
- Why These Automata Types?
Cited in
(3)
This page was built for publication: Quantitative vs. weighted automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695484)
