APA (7th ed.) Citation

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

Chicago Style (17th ed.) Citation

Karandikar, Prateek, and 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.

MLA (9th ed.) Citation

Karandikar, Prateek, and 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.