Valuations of weighted automata: doing it in a rational way
From MaRDI portal
Publication:3098044
DOI10.1007/978-3-642-24897-9_14zbMATH Open1350.68175OpenAlexW52973317MaRDI QIDQ3098044FDOQ3098044
Authors: Ingmar Meinecke
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
Recommendations
- Weighted automata and regular expressions over valuation monoids
- Regular Expressions on Average and in the Long Run
- Expressiveness and closure properties for quantitative languages
- ON WEIGHTED BÜCHI AUTOMATA WITH ORDER-COMPLETE WEIGHTS
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
Cites Work
- Title not available (Why is that?)
- Handbook of weighted automata
- On the definition of a family of automata
- On iteration semiring-semimodule pairs.
- Expressiveness and closure properties for quantitative languages
- Alternating Weighted Automata
- Weighted automata and regular expressions over valuation monoids
- Quantitative Languages
- Weighted automata with discounting
- Cycle-Free Finite Automata in Partial Iterative Semirings
- Unambiguous Büchi automata.
- Derivatives of rational expressions with multiplicity
- Kleene and Büchi theorems for weighted automata and multi-valued logics over arbitrary bounded lattices
- Weighted finite automata over strong bimonoids
- Rational \(\omega\)-languages are non-ambiguous
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics
- Recognizable formal power series on trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weighted grammars and Kleene's theorem
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
- Branching automata with costs -- a way of reflecting parallelism in costs
- Weighted automata and weighted logics with discounting
- Probabilistic Weighted Automata
- On aperiodic and star-free formal power series in partially commuting variables
- Skew and infinitary formal power series
- Infinite fuzzy computations
- ON WEIGHTED BÜCHI AUTOMATA WITH ORDER-COMPLETE WEIGHTS
- Characterizations of recognizable picture series
- Title not available (Why is that?)
- Schützenberger's theorem on formal power series follows from Kleene's theorem
- Automatentheorie und Logik
- Describing average- and longtime-behavior by weighted MSO logics
- Regular Expressions on Average and in the Long Run
Cited In (8)
- ON WEIGHTED BÜCHI AUTOMATA WITH ORDER-COMPLETE WEIGHTS
- Weighted automata and weighted MSO logics for average and long-time behaviors
- Weighted automata and regular expressions over valuation monoids
- A translation of weighted LTL formulas to weighted Büchi automata over \(\omega\)-valuation monoids
- Weighted automata
- Finite-valued weighted automata
- Weighted finite automata over hemirings
- Conway and iteration hemirings. II.
This page was built for publication: Valuations of weighted automata: doing it in a rational way
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3098044)