Citace podle APA (7th ed.)

Hofman, P., Juzepczuk, M., Lasota, S., & Pattathurajan, M. (2021, June 29). Parikh's theorem for infinite alphabets. Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 1-13. https://doi.org/10.1109/LICS52264.2021.9470626

Citace podle Chicago (17th ed.)

Hofman, Piotr, Marta Juzepczuk, Slawomir Lasota, a Mohnish Pattathurajan. "Parikh's Theorem for Infinite Alphabets." Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science 29 Jun. 2021: 1-13. https://doi.org/10.1109/LICS52264.2021.9470626.

Citace podle MLA (9th ed.)

Hofman, Piotr, et al. "Parikh's Theorem for Infinite Alphabets." Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 29 Jun. 2021, pp. 1-13, https://doi.org/10.1109/LICS52264.2021.9470626.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..