Pages that link to "Item:Q5327434"
From MaRDI portal
The following pages link to Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method (Q5327434):
Displaying 7 items.
- A new one pass algorithm for estimating stochastic context-free grammars (Q294698) (← links)
- A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars (Q396602) (← links)
- THE BENFORD-NEWCOMB DISTRIBUTION AND UNAMBIGUOUS CONTEXT-FREE LANGUAGES (Q3538858) (← links)
- (Q4536488) (← links)
- (Q5020647) (← links)
- Quantitative Verification of Stochastic Regular Expressions (Q5164850) (← links)
- CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS (Q5896876) (← links)