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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters Jg. 113; H. 10-11; S. 381 - 385
Hauptverfasser: Esparza, Javier, Gaiser, Andreas, Kiefer, Stefan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Amsterdam Elsevier B.V 01.05.2013
Elsevier Sequoia S.A
Schlagworte:
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-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 branching processes.•The same algorithm decides consistency of stochastic context-free grammars.•We apply the algorithm to a problem of nuclear physics.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2013.02.015