Karandikar, P., & Schnoebelen, P. (2019). The height of piecewise-testable languages and the complexity of the logic of subwords. Logical methods in computer science, 15, Issue 2(2), . https://doi.org/10.23638/LMCS-15(2:6)2019
Citace podle Chicago (17th ed.)Karandikar, Prateek, a Philippe Schnoebelen. "The Height of Piecewise-testable Languages and the Complexity of the Logic of Subwords." Logical Methods in Computer Science 15, Issue 2, no. 2 (2019). https://doi.org/10.23638/LMCS-15(2:6)2019.
Citace podle MLA (9th ed.)Karandikar, Prateek, a Philippe Schnoebelen. "The Height of Piecewise-testable Languages and the Complexity of the Logic of Subwords." Logical Methods in Computer Science, vol. 15, Issue 2, no. 2, 2019, https://doi.org/10.23638/LMCS-15(2:6)2019.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..