Fernau, H., Schmid, M. L., & Villanger, Y. (2016). On the Parameterised Complexity of String Morphism Problems. Theory of Computing Systems, 59(1), 24. https://doi.org/10.1007/s00224-015-9635-3
Chicago-referens (17:e uppl.)Fernau, Henning, Markus L. Schmid, och Yngve Villanger. "On the Parameterised Complexity of String Morphism Problems." Theory of Computing Systems 59, no. 1 (2016): 24. https://doi.org/10.1007/s00224-015-9635-3.
MLA-referens (9:e uppl.)Fernau, Henning, et al. "On the Parameterised Complexity of String Morphism Problems." Theory of Computing Systems, vol. 59, no. 1, 2016, p. 24, https://doi.org/10.1007/s00224-015-9635-3.
Varning: dessa hänvisningar är inte alltid fullständigt riktiga.
