A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars

We provide a strongly polynomial algorithm for determining whether a given multi-type branching process is subcritical, critical, or supercritical. The same algorithm also decides consistency of stochastic context-free grammars. •We provide the first strongly polynomial algorithm for criticality of...

Full description

Bibliographic Details

Published in:	Information processing letters Vol. 113; no. 10-11; pp. 381 - 385
Main Authors:	Esparza, Javier, Gaiser, Andreas, Kiefer, Stefan
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.05.2013 Elsevier Sequoia S.A
Subjects:	Algorithms Branching processes Computer science Exact matrix computations Polynomials Stochastic context-free grammars Stochastic models Studies Exact matrix computations Algorithms Branching processes Stochastic context-free grammars
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!