Esparza, J., Gaiser, A., & Kiefer, S. (2013). A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars. Information processing letters, 113(10-11), 381-385. https://doi.org/10.1016/j.ipl.2013.02.015
Citace podle Chicago (17th ed.)Esparza, Javier, Andreas Gaiser, a Stefan Kiefer. "A Strongly Polynomial Algorithm for Criticality of Branching Processes and Consistency of Stochastic Context-free Grammars." Information Processing Letters 113, no. 10-11 (2013): 381-385. https://doi.org/10.1016/j.ipl.2013.02.015.
Citace podle MLA (9th ed.)Esparza, Javier, et al. "A Strongly Polynomial Algorithm for Criticality of Branching Processes and Consistency of Stochastic Context-free Grammars." Information Processing Letters, vol. 113, no. 10-11, 2013, pp. 381-385, https://doi.org/10.1016/j.ipl.2013.02.015.