Expressiveness and Closure Properties for Quantitative Languages
From MaRDI portal
Publication:2786127
DOI10.2168/LMCS-6(3:10)2010zbMath1200.68135arXiv1007.4018OpenAlexW1967389018MaRDI QIDQ2786127
Laurent Doyen, Krishnendu Chatterjee, Thomas A. Henzinger
Publication date: 21 September 2010
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1007.4018
Related Items (25)
Probabilistic Weighted Automata ⋮ Rigorous approximated determinization of weighted automata ⋮ Parameterized Weighted Containment ⋮ Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics ⋮ On the comparison of discounted-sum automata with multiple discount factors ⋮ A Nivat theorem for weighted picture automata and weighted MSO logics ⋮ Optimal repair for omega-regular properties ⋮ Quantitative Automata under Probabilistic Semantics ⋮ Multi-weighted automata and MSO logic ⋮ Weighted modal transition systems ⋮ Compositional Branching-Time Measurements ⋮ Quantitative Simulation Games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Determinization of weighted finite automata over strong bimonoids ⋮ A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic ⋮ On deterministic weighted automata ⋮ Regular Expressions on Average and in the Long Run ⋮ What's decidable about weighted automata? ⋮ Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics ⋮ Valuations of Weighted Automata: Doing It in a Rational Way ⋮ Simulation distances ⋮ Weighted automata ⋮ Bidirectional nested weighted automata ⋮ Measuring and Synthesizing Systems in Probabilistic Environments
This page was built for publication: Expressiveness and Closure Properties for Quantitative Languages
