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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 113; číslo 10-11; s. 381 - 385
Hlavní autoři: Esparza, Javier, Gaiser, Andreas, Kiefer, Stefan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 01.05.2013
Elsevier Sequoia S.A
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2013.02.015