Pages that link to "Item:Q4385674"
From MaRDI portal
The following pages link to Accurate computation of the relative entropy between stochastic regular grammars (Q4385674):
Displaying 5 items.
- Computing the relative entropy between regular tree languages (Q293468) (← links)
- Computation of distances for regular and context-free probabilistic languages (Q932320) (← links)
- A similarity between probabilistic tree languages: Application to XML document families. (Q1400519) (← links)
- Discovering stochastic process models by reduction and abstraction (Q2117180) (← links)
- Efficient Computation of the Relative Entropy of Probabilistic Automata (Q3525770) (← links)