Pages that link to "Item:Q932320"
From MaRDI portal
The following pages link to Computation of distances for regular and context-free probabilistic languages (Q932320):
Displaying 10 items.
- A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars (Q396602) (← links)
- Computation of moments for probabilistic finite-state automata (Q2660903) (← links)
- Parameterized Prefix Distance between Regular Languages (Q2938119) (← links)
- (Q4965819) (← links)
- Regular Language Distance and Entropy (Q5111217) (← links)
- Definitions and properties of entropy and distance for regular languages (Q5210870) (← links)
- Structural, Syntactic, and Statistical Pattern Recognition (Q5466321) (← links)
- CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS (Q5896876) (← links)
- CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS (Q5896879) (← links)
- Finite Approximations and Similarity of Languages (Q6169950) (← links)