The following pages link to Handbook of weighted automata (Q836989):
Displaying 50 items.
- A unifying approach to algebraic systems over semirings (Q2000006) (← links)
- Non-deterministic weighted automata evaluated over Markov chains (Q2009651) (← links)
- On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids (Q2013556) (← links)
- Weighted automata are compact and actively learnable (Q2032169) (← links)
- Conditions for the existence of maximal factorizations (Q2035282) (← links)
- Finite sequentiality of unambiguous max-plus tree automata (Q2048206) (← links)
- Kleene and Büchi theorems for weighted forest languages over M-monoids (Q2051789) (← links)
- Determinisability of unary weighted automata over the rational numbers (Q2055977) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- Weighted propositional configuration logics: a specification language for architectures with quantitative features (Q2064516) (← links)
- Bisimulation metrics and norms for real-weighted automata (Q2064519) (← links)
- What's decidable about weighted automata? (Q2064522) (← links)
- Weighted automata computation of edit distances with consolidations and fragmentations (Q2064523) (← links)
- Regular transducer expressions for regular transformations (Q2064527) (← links)
- Principal abstract families of weighted tree languages (Q2064529) (← links)
- Weighted operator precedence languages (Q2064530) (← links)
- Automata and rational expressions (Q2074204) (← links)
- Weighted automata (Q2074206) (← links)
- On some decidability questions concerning supports of rational series (Q2094367) (← links)
- Disambiguation of weighted tree automata (Q2096595) (← links)
- Image-binary automata (Q2096597) (← links)
- Finite ambiguity and finite sequentiality in weighted automata over fields (Q2097226) (← links)
- A robust class of linear recurrence sequences (Q2105454) (← links)
- Ambiguity hierarchies for weighted tree automata (Q2117674) (← links)
- Verification of multiplayer stochastic games via abstract dependency graphs (Q2119119) (← links)
- Learning infinite-word automata with loop-index queries (Q2124472) (← links)
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids (Q2136289) (← links)
- Gradient-descent for randomized controllers under partial observability (Q2152644) (← links)
- Symbolic weighted language models, quantitative parsing and automated music transcription (Q2164736) (← links)
- An ambiguity hierarchy of weighted context-free grammars (Q2164759) (← links)
- Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy (Q2177476) (← links)
- A contribution to the determinization of max-plus automata (Q2177784) (← links)
- McCarthy-Kleene fuzzy automata and MSO logics (Q2182728) (← links)
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders (Q2200645) (← links)
- Approximated determinisation of weighted tree automata (Q2232287) (← links)
- Sequentiality of group-weighted tree automata (Q2232288) (← links)
- Combining semilattices and semimodules (Q2233397) (← links)
- Towards general axiomatizations for bisimilarity and trace semantics (Q2237336) (← links)
- Weighted modal transition systems (Q2248057) (← links)
- Complete proof systems for weighted modal logic (Q2253184) (← links)
- A fixed point theorem for non-monotonic functions (Q2257304) (← links)
- Weighted automata with storage (Q2280328) (← links)
- Capacitated automata and systems (Q2280332) (← links)
- Streamable regular transductions (Q2286735) (← links)
- The relationships among several forms of weighted finite automata over strong bimonoids (Q2293180) (← links)
- A new foundation for finitary corecursion and iterative algebras (Q2304521) (← links)
- Context-free coalgebras (Q2341705) (← links)
- New representations for (max,+) automata with applications to performance evaluation and control of discrete event systems (Q2348373) (← links)
- Characterizing weighted MSO for trees by branching transitive closure logics (Q2355685) (← links)
- Survey: finite-state technology in natural language processing (Q2357102) (← links)
