Pages that link to "Item:Q3525770"
From MaRDI portal
The following pages link to Efficient Computation of the Relative Entropy of Probabilistic Automata (Q3525770):
Displaying 7 items.
- Computation of distances for regular and context-free probabilistic languages (Q932320) (← links)
- On the existence of regular approximations (Q2465045) (← links)
- A FIRST-ORDER OPTIMAL ALGORITHM FOR STATE IDENTIFICATION IN SEQUENTIAL LOGIC USING THE CONCEPT OF ENTROPY (Q3799635) (← links)
- Accurate computation of the relative entropy between stochastic regular grammars (Q4385674) (← links)
- Regular Language Distance and Entropy (Q5111217) (← links)
- Learning Theory and Kernel Machines (Q5305885) (← links)
- Diagnosis and Automata (Q5496923) (← links)