The following pages link to Handbook of weighted automata (Q836989):
Displaying 50 items.
- Model measuring for discrete and hybrid systems (Q2374564) (← links)
- Axiomatizing rational power series over natural numbers (Q2389332) (← links)
- Weighted iterated linear control (Q2422779) (← links)
- Recognizable series on graphs and hypergraphs (Q2424675) (← links)
- On continuous weighted finite automata (Q2427883) (← links)
- Weighted logics for unranked tree automata (Q2429720) (← links)
- Convolution algebras over complete semirings. (Q2439445) (← links)
- Some convergence and stability results for two new Kirk type hybrid fixed point iterative algorithms (Q2443808) (← links)
- A note on probabilistic models over strings: the linear algebra approach (Q2446798) (← links)
- Adding pebbles to weighted automata: easy specification \& efficient evaluation (Q2447753) (← links)
- An algebraic characterization of semirings for which the support of every recognizable series is recognizable (Q2447754) (← links)
- The complexity of computing the behaviour of lattice automata on infinite trees (Q2447756) (← links)
- Parameterized model checking of weighted networks (Q2447757) (← links)
- Bisimulations for weighted automata over an additively idempotent semiring (Q2447758) (← links)
- On weighted first-order logics with discounting (Q2453983) (← links)
- Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness (Q2658032) (← links)
- Rational elements of summation semirings (Q2663048) (← links)
- Initial-state detectability and initial-state opacity of unambiguous weighted automata (Q2664211) (← links)
- Greibach normal form for \(\omega\)-algebraic systems and weighted simple \(\omega\)-pushdown automata (Q2672253) (← links)
- On quotients of formal power series (Q2672254) (← links)
- Catoids and modal convolution algebras (Q2686581) (← links)
- An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring (Q2799165) (← links)
- Regular Programming for Quantitative Properties of Data Streams (Q2802466) (← links)
- A New Foundation for Finitary Corecursion (Q2811335) (← links)
- Enhancing Automata Learning by Log-Based Metrics (Q2814131) (← links)
- Weighted Automata and Logics on Infinite Graphs (Q2817384) (← links)
- Weighted Symbolic Automata with Data Storage (Q2817389) (← links)
- On Finite and Polynomial Ambiguity of Weighted Tree Automata (Q2817402) (← links)
- Prefix Distance Between Regular Languages (Q2830223) (← links)
- Models for quantitative distributed systems and multi-valued logics (Q2855751) (← links)
- Complexity of Equivalence and Learning for Multiplicity Tree Automata (Q2922034) (← links)
- Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers (Q2941142) (← links)
- Polynomial Functors Constrained by Regular Expressions (Q2941172) (← links)
- A Program Construction and Verification Tool for Separation Logic (Q2941173) (← links)
- Recurrence Function on Sturmian Words: A Probabilistic Study (Q2946329) (← links)
- Temporal Specifications with Accumulative Values (Q2946736) (← links)
- Learning Weighted Automata (Q2947142) (← links)
- Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics (Q2947150) (← links)
- Logics for Weighted Timed Pushdown Automata (Q2947171) (← links)
- Inherent Vacuity in Lattice Automata (Q2947173) (← links)
- Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics (Q2964452) (← links)
- Ancient Typefaces and Parametric Weighted Finite Automata (Q3003470) (← links)
- The compositional construction of Markov processes II (Q3006162) (← links)
- Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems (Q3014928) (← links)
- Regular Expressions on Average and in the Long Run (Q3073640) (← links)
- Weighted Tree Automata over Valuation Monoids and Their Characterization by Weighted Logics (Q3098032) (← links)
- Valuations of Weighted Automata: Doing It in a Rational Way (Q3098044) (← links)
- A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources (Q3178291) (← links)
- Weighted Register Automata and Weighted Logic on Data Words (Q3179411) (← links)
- An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable (Q3182949) (← links)
