Valuations of Weighted Automata: Doing It in a Rational Way
From MaRDI portal
Publication:3098044
DOI10.1007/978-3-642-24897-9_14zbMath1350.68175MaRDI QIDQ3098044
Publication date: 11 November 2011
Published in: Algebraic Foundations in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24897-9_14
Related Items
Weighted finite automata over hemirings, Weighted automata and weighted MSO logics for average and long-time behaviors, Weighted automata, Conway and iteration hemirings Part 2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branching automata with costs -- a way of reflecting parallelism in costs
- Handbook of weighted automata
- Weighted automata and weighted logics with discounting
- Weighted finite automata over strong bimonoids
- Skew and infinitary formal power series
- On aperiodic and star-free formal power series in partially commuting variables
- Schützenberger's theorem on formal power series follows from Kleene's theorem
- Weighted automata with discounting
- Characterizations of recognizable picture series
- Rational \(\omega\)-languages are non-ambiguous
- Weighted grammars and Kleene's theorem
- Recognizable formal power series on trees
- Unambiguous Büchi automata.
- Derivatives of rational expressions with multiplicity
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
- Infinite fuzzy computations
- On iteration semiring-semimodule pairs.
- Expressiveness and Closure Properties for Quantitative Languages
- Regular Expressions on Average and in the Long Run
- Automatentheorie und Logik
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- Alternating Weighted Automata
- Probabilistic Weighted Automata
- WEIGHTED AUTOMATA AND REGULAR EXPRESSIONS OVER VALUATION MONOIDS
- On the definition of a family of automata
- Quantitative Languages
- Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices
- Describing Average- and Longtime-Behavior by Weighted MSO Logics
- Cycle-Free Finite Automata in Partial Iterative Semirings
- ON WEIGHTED BÜCHI AUTOMATA WITH ORDER-COMPLETE WEIGHTS
