Entropies and combinatorics of random branching processes and context-free languages
DOI10.1109/18.144710zbMATH Open0791.68094OpenAlexW2005336926MaRDI QIDQ4014145FDOQ4014145
Authors: Michael I. Miller, Joseph A. O'Sullivan Edit this on Wikidata
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
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
Formal languages and automata (68Q45) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (8)
- 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
- Generalised entropies and asymptotic complexities of languages
- Syntactic stochastic processes: definitions, models, and related inference problems
- Long time behaviour for Markovian branching-immigration systems
- Exploiting syntactic, semantic, and lexical regularities in language modeling via directed Markov random fields
- 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)
