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

DOI10.1109/18.144710MaRDI QIDQ4014145zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Random Context-Free Grammars: Supercritical Case with a Nonzero Extinction Probability
• On the properties of a stochastic context-free language generated by a grammar with two classes of nonterminal symbols
• scientific article; zbMATH DE number 2047434
• Asymptotical growth of a class of random trees
• scientific article; zbMATH DE number 1936533

Cited in

(8)

• Long time behaviour for Markovian branching-immigration systems
• The growth of iterates of multivariate generating functions
• Syntactic stochastic processes: definitions, models, and related inference problems
• Asymptotic behavior for supercritical branching processes
• Exploiting syntactic, semantic, and lexical regularities in language modeling via directed Markov random fields
• Limit laws of estimators for critical multi-type Galton-Watson processes
• Generalised entropies and asymptotic complexities of languages
• Random Context-Free Grammars: Supercritical Case with a Nonzero Extinction Probability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4014145)