Jacquet, P., & Szpankowski, W. (2012). Joint String Complexity for Markov Sources. Discrete mathematics and theoretical computer science, DMTCS Proceedings vol. AQ,...(Proceedings), 303-322. https://doi.org/10.46298/dmtcs.3001
Chicago-Zitierstil (17. Ausg.)Jacquet, Philippe, und Wojciech Szpankowski. "Joint String Complexity for Markov Sources." Discrete Mathematics and Theoretical Computer Science DMTCS Proceedings vol. AQ,..., no. Proceedings (2012): 303-322. https://doi.org/10.46298/dmtcs.3001.
MLA-Zitierstil (9. Ausg.)Jacquet, Philippe, und Wojciech Szpankowski. "Joint String Complexity for Markov Sources." Discrete Mathematics and Theoretical Computer Science, vol. DMTCS Proceedings vol. AQ,..., no. Proceedings, 2012, pp. 303-322, https://doi.org/10.46298/dmtcs.3001.