scientific article; zbMATH DE number 1916666
From MaRDI portal
Publication:4807826
zbMath1033.68067MaRDI QIDQ4807826
Publication date: 26 May 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (35)
Learning probabilistic automata using residuals ⋮ Finding the \(N\) best vertices in an infinite weighted hypergraph ⋮ On the algebraic theory of loop free routing ⋮ Algebraic program analysis ⋮ Model measuring for discrete and hybrid systems ⋮ Tropical Time Series, Iterated-Sums Signatures, and Quasisymmetric Functions ⋮ C-semiring Frameworks for Minimum Spanning Tree Problems ⋮ Symbolic weighted language models, quantitative parsing and automated music transcription ⋮ Algorithms for non-linear and stochastic resource constrained shortest path ⋮ Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers ⋮ OpenFst: A General and Efficient Weighted Finite-State Transducer Library ⋮ Semiring-Based Soft Constraints ⋮ Algebraic theory on shortest paths for all flows ⋮ Convergence of Newton's method over commutative semirings ⋮ Computing least and greatest fixed points in absorptive semirings ⋮ Congruence openings of additive Green's relations on a semiring. ⋮ Bisimulations for weighted automata over an additively idempotent semiring ⋮ An algebraic framework for multi-objective and robust variants of path problems ⋮ Quantitative Automata under Probabilistic Semantics ⋮ Sequence alignment with arbitrary steps and further generalizations, with applications to alignments in linguistics ⋮ An optimal pre-determinization algorithm for weighted transducers ⋮ Weighted path queries on semistructured databases ⋮ Using Ranked Semirings for Representing Morphology Automata ⋮ fsm2 – A Scripting Language for Creating Weighted Finite-State Morphologies ⋮ Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs ⋮ Model checking for a class of weighted automata ⋮ Unnamed Item ⋮ Security and trust for wireless autonomic networks. Systems and control methods ⋮ Filters for Efficient Composition of Weighted Finite-State Transducers ⋮ Weighted parsing for grammar-based language models over multioperator monoids ⋮ Weighted automata computation of edit distances with consolidations and fragmentations ⋮ Bidirectional nested weighted automata ⋮ Explainable dynamic programming ⋮ Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming ⋮ Algorithms for probabilistic and stochastic subsequential failure transducers
This page was built for publication:
