Quantitative vs. weighted automata
From MaRDI portal
Publication:2695484
DOI10.1007/978-3-030-89716-1_1OpenAlexW3210996054MaRDI QIDQ2695484FDOQ2695484
Authors: Udi Boker 
Publication date: 31 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-89716-1_1
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
- Probabilistic automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alternation
- Title not available (Why is that?)
- On the definition of a family of automata
- The Theory of Stabilisation Monoids and Regular Cost Functions
- On finite monoids having only trivial subgroups
- Better Quality in Synthesis through Quantitative Objectives
- Decision Problems of Finite Automata Design and Related Arithmetics
- Title not available (Why is that?)
- First-order logic and star-free sets
- Discounting in LTL
- QUASY: quantitative synthesis tool
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
- A combinatorial approach to the theory of ω-automata
- Finite Automata Computing Real Functions
- Reasoning about online algorithms with weighted automata
- Approximate determinization of quantitative automata
- What's decidable about weighted automata?
- Alternating Weighted Automata
- Quantitative Languages
- Rigorous approximated determinization of weighted automata
- Title not available (Why is that?)
- An approximate determinization algorithm for weighted finite-state automata
- Title not available (Why is that?)
- Quantitative languages
- Application of model theoretic games to discrete linear orders and finite automata
- Star-free regular sets of ω-sequences
- Solving Games Without Determinization
- Title not available (Why is that?)
- Weighted automata and weighted MSO logics for average and long-time behaviors
- Weighted automata and weighted logics
- Alternating Pushdown and Stack Automata
- Weighted Automata and Weighted Logics on Infinite Words
- Reactive synthesis without regret
- Exact and approximate determinization of discounted-sum automata
- Temporal specifications with accumulative values
- First-order definable languages
- Title not available (Why is that?)
- Formally reasoning about quality
- Model Checking Quantitative Linear Time Logic
- Max and sum semantics for alternating weighted automata
- Automata theory and model checking
- Alternating weighted automata over commutative semirings
- A unifying survey on weighted logics and weighted automata. Core weighted logic: minimal and versatile specification of quantitative properties
- Quantitative languages defined by functional automata
- Describing average- and longtime-behavior by weighted MSO logics
- Quantitative assume guarantee synthesis
- Non-zero sum games for reactive synthesis
- Universal graphs and good for games automata: new tools for infinite duration games
- On delay and regret determinization of max-plus automata
- Averaging in LTL
- Why These Automata Types?
- Weighted LTL with discounting
- Weighted automata on infinite words in the context of attacker-defender games
- Nested weighted automata
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
Uses Software
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)
