Pages that link to "Item:Q3532153"
From MaRDI portal
The following pages link to ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA (Q3532153):
Displaying 9 items.
- On the computational complexity of approximating distributions by probabilistic automata (Q1207305) (← links)
- Entropies of the automata networks with additive rule (Q1289709) (← links)
- Computation of moments for probabilistic finite-state automata (Q2660903) (← links)
- GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS (Q3016223) (← links)
- OpenFst: A General and Efficient Weighted Finite-State Transducer Library (Q3503890) (← links)
- Efficient Computation of the Relative Entropy of Probabilistic Automata (Q3525770) (← links)
- A FIRST-ORDER OPTIMAL ALGORITHM FOR STATE IDENTIFICATION IN SEQUENTIAL LOGIC USING THE CONCEPT OF ENTROPY (Q3799635) (← links)
- CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS (Q5896876) (← links)
- CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS (Q5896879) (← links)