Branching processes with terminal types: application to context-free grammars

DOI10.2307/3211893zbMath0222.60055OpenAlexW4251687331MaRDI QIDQ5627485

David Sankoff

Publication date: 1971

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3211893

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of branching processes (60J85)

Related Items (4)

Branching processes. II ⋮ Expectation maximization estimates of the offspring probabilities in a class of multitype branching processes with binary family trees ⋮ Properties of stochastic syntax-directed translation schemata ⋮ Context-free grammars and nonnegative matrices

This page was built for publication: Branching processes with terminal types: application to context-free grammars