Pages that link to "Item:Q3021943"
From MaRDI portal
The following pages link to GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS (Q3021943):
Displaying 13 items.
- Kernel methods for learning languages (Q950199) (← links)
- Extraction and recoding of input-\(\varepsilon\)-cycles in finite state transducers. (Q1426170) (← links)
- Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
- A note on probabilistic models over strings: the linear algebra approach (Q2446798) (← links)
- The validity of weighted automata (Q2842025) (← links)
- Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization (Q3073636) (← links)
- L<sub>p</sub> DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA (Q3503091) (← links)
- PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA (Q3503094) (← links)
- OpenFst: A General and Efficient Weighted Finite-State Transducer Library (Q3503890) (← links)
- Parametric Language Analysis of the Class of Stop-and-Wait Protocols (Q3510867) (← links)
- ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA (Q3532153) (← links)
- Diagnosis and Automata (Q5496923) (← links)
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS (Q5696947) (← links)