Decidable weighted expressions with Presburger combinators
From MaRDI portal
Publication:5915759
DOI10.1007/978-3-662-55751-8_20zbMath1429.68112arXiv1706.08855OpenAlexW2949645176WikidataQ127669191 ScholiaQ127669191MaRDI QIDQ5915759
Nicolas Mazzocchi, Emmanuel Filiot, Jean-François Raskin
Publication date: 22 November 2017
Published in: Journal of Computer and System Sciences, Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.08855
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
- Handbook of weighted automata
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Weighted automata and weighted logics
- Rational sets in commutative monoids
- Quantitative languages
- Finite-Valued Weighted Automata.
- The Complexity of Mean-Payoff Automaton Expression
- What’s Decidable about Weighted Automata?
- Complexity of Subcases of Presburger Arithmetic
- Mean-Payoff Automaton Expressions
- THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
- Regular combinators for string transformations
- Path Logics for Querying Graphs: Combining Expressiveness and Efficiency
- Nested Weighted Automata
- Decision Problems for Additive Regular Functions
- Quantitative Languages Defined by Functional Automata
- Decidable weighted expressions with Presburger combinators
This page was built for publication: Decidable weighted expressions with Presburger combinators
