Entropies and combinatorics of random branching processes and context-free languages

DOI10.1109/18.144710zbMath0791.68094OpenAlexW2005336926MaRDI QIDQ4014145

Michael I. Miller, Joseph A. O'Sullivan

Publication date: 11 October 1992

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.144710

zbMATH Keywords

branching processescontext free languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

EXPLOITING SYNTACTIC, SEMANTIC, AND LEXICAL REGULARITIES IN LANGUAGE MODELING VIA DIRECTED MARKOV RANDOM FIELDS ⋮ Asymptotic behavior for supercritical branching processes ⋮ The growth of iterates of multivariate generating functions ⋮ Limit laws of estimators for critical multi-type Galton-Watson processes ⋮ Syntactic stochastic processes: definitions, models, and related inference problems ⋮ Long time behaviour for Markovian branching-immigration systems

This page was built for publication: Entropies and combinatorics of random branching processes and context-free languages