The following pages link to (Q4807826):
Displaying 38 items.
- Sequence alignment with arbitrary steps and further generalizations, with applications to alignments in linguistics (Q497193) (← links)
- Congruence openings of additive Green's relations on a semiring. (Q637601) (← links)
- An optimal pre-determinization algorithm for weighted transducers (Q703490) (← links)
- On the algebraic theory of loop free routing (Q832107) (← links)
- Algebraic program analysis (Q832153) (← links)
- Convergence of Newton's method over commutative semirings (Q899320) (← links)
- Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs (Q2032145) (← links)
- Weighted parsing for grammar-based language models over multioperator monoids (Q2051800) (← links)
- Weighted automata computation of edit distances with consolidations and fragmentations (Q2064523) (← links)
- Algorithms for probabilistic and stochastic subsequential failure transducers (Q2117672) (← links)
- Learning probabilistic automata using residuals (Q2119983) (← links)
- Symbolic weighted language models, quantitative parsing and automated music transcription (Q2164736) (← links)
- Finding the \(N\) best vertices in an infinite weighted hypergraph (Q2358678) (← links)
- Model measuring for discrete and hybrid systems (Q2374564) (← links)
- Algorithms for non-linear and stochastic resource constrained shortest path (Q2417959) (← links)
- Algebraic theory on shortest paths for all flows (Q2424883) (← links)
- Bisimulations for weighted automata over an additively idempotent semiring (Q2447758) (← links)
- Weighted path queries on semistructured databases (Q2495649) (← links)
- Security and trust for wireless autonomic networks. Systems and control methods (Q2512096) (← links)
- Computing least and greatest fixed points in absorptive semirings (Q2695365) (← links)
- Modelling multicast QoS routing by using best-tree search in and-or graphs and soft constraint logic programming (Q2870287) (← links)
- Filters for Efficient Composition of Weighted Finite-State Transducers (Q3073618) (← links)
- C-semiring Frameworks for Minimum Spanning Tree Problems (Q3184724) (← links)
- An algebraic framework for multi-objective and robust variants of path problems (Q3297414) (← links)
- OpenFst: A General and Efficient Weighted Finite-State Transducer Library (Q3503890) (← links)
- (Q3506121) (← links)
- Semiring-Based Soft Constraints (Q3507363) (← links)
- Quantitative Automata under Probabilistic Semantics (Q4635863) (← links)
- Explainable dynamic programming (Q5016213) (← links)
- Tropical Time Series, Iterated-Sums Signatures, and Quasisymmetric Functions (Q5057036) (← links)
- (Q5101352) (← links)
- Bidirectional nested weighted automata (Q5111617) (← links)
- Using Ranked Semirings for Representing Morphology Automata (Q5188609) (← links)
- fsm2 – A Scripting Language for Creating Weighted Finite-State Morphologies (Q5188619) (← links)
- Model checking for a class of weighted automata (Q5962025) (← links)
- Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers (Q6070754) (← links)
- Semiring provenance for Büchi games: strategy analysis with absorptive polynomials (Q6563045) (← links)
- Semiring provenance for Büchi games: strategy analysis with absorptive polynomials (Q6649515) (← links)
