Quantitative language automata
From MaRDI portal
Cites work
- A characterization of the minimum cycle mean in a digraph
- A new polynomial-time algorithm for linear programming
- A pattern logic for automata with outputs
- Alternating Weighted Automata
- Büchi complementation made tight
- Complementing Büchi Automata with Ranker
- Defining liveness
- Energy and mean-payoff games with imperfect information
- Expressiveness and closure properties for quantitative languages
- From model checking to model measuring
- Mean-payoff automaton expressions
- Mean-payoff games with partial observation
- Model checking quantitative hyperproperties
- Non-deterministic weighted automata evaluated over Markov chains
- On finitely ambiguous Büchi automata
- On the degree of ambiguity of finite automata
- On the undecidability of probabilistic planning and related stochastic optimization problems
- Proving the Correctness of Multiprocess Programs
- Quantitative languages
- Quantitative safety and liveness
- Safety and liveness of quantitative automata
- Safety and liveness of quantitative properties and automata
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- The target discounted-sum problem
- Tools and algorithms for the construction and analysis of systems. 31st international conference, TACAS 2025, held as part of the international joint conferences on theory and practice of software, ETAPS 2025, Hamilton, ON, Canada, May 3--8, 2025. Proceed
- Verification of quantitative hyperproperties using trace enumeration relations
- What's decidable about weighted automata?
This page was built for publication: Quantitative language automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310292)
