RABINOVICH, A., & TIFERET, D. (2021). AMBIGUITY HIERARCHY OF REGULAR INFINITE TREE LANGUAGES. Logical Methods in Computer Science (LMCS), 17(3), 1. https://doi.org/10.46298/LMCS-17(3:18)2021
Chicago Style (17th ed.) CitationRABINOVICH, ALEXANDER, and DORON TIFERET. "AMBIGUITY HIERARCHY OF REGULAR INFINITE TREE LANGUAGES." Logical Methods in Computer Science (LMCS) 17, no. 3 (2021): 1. https://doi.org/10.46298/LMCS-17(3:18)2021.
MLA (9th ed.) CitationRABINOVICH, ALEXANDER, and DORON TIFERET. "AMBIGUITY HIERARCHY OF REGULAR INFINITE TREE LANGUAGES." Logical Methods in Computer Science (LMCS), vol. 17, no. 3, 2021, p. 1, https://doi.org/10.46298/LMCS-17(3:18)2021.
Warning: These citations may not always be 100% accurate.