APA (7th ed.) Citation

BOJAŃCZYK, M., & KLIN, B. (2019). A NON-REGULAR LANGUAGE OF INFINITE TREES THAT IS RECOGNIZED BY A SORT-WISE FINITE ALGEBRA. Logical Methods in Computer Science (LMCS), 15(4), 1. https://doi.org/10.23638/LMCS-15(4:11)2019

Chicago Style (17th ed.) Citation

BOJAŃCZYK, MIKOŁAJ, and BARTEK KLIN. "A NON-REGULAR LANGUAGE OF INFINITE TREES THAT IS RECOGNIZED BY A SORT-WISE FINITE ALGEBRA." Logical Methods in Computer Science (LMCS) 15, no. 4 (2019): 1. https://doi.org/10.23638/LMCS-15(4:11)2019.

MLA (9th ed.) Citation

BOJAŃCZYK, MIKOŁAJ, and BARTEK KLIN. "A NON-REGULAR LANGUAGE OF INFINITE TREES THAT IS RECOGNIZED BY A SORT-WISE FINITE ALGEBRA." Logical Methods in Computer Science (LMCS), vol. 15, no. 4, 2019, p. 1, https://doi.org/10.23638/LMCS-15(4:11)2019.