APA (7th ed.) Citation

FRANKEN, T. T. P., & NEELE, T. (2026). EXPRESSIVITY OF AUDALA: TURING COMPLETENESS AND POSSIBLE EXTENSIONS. Logical Methods in Computer Science (LMCS), 22(2), 1. https://doi.org/10.46298/LMCS-22(2:5)2026

Chicago Style (17th ed.) Citation

FRANKEN, TOM T. P., and THOMAS NEELE. "EXPRESSIVITY OF AUDALA: TURING COMPLETENESS AND POSSIBLE EXTENSIONS." Logical Methods in Computer Science (LMCS) 22, no. 2 (2026): 1. https://doi.org/10.46298/LMCS-22(2:5)2026.

MLA (9th ed.) Citation

FRANKEN, TOM T. P., and THOMAS NEELE. "EXPRESSIVITY OF AUDALA: TURING COMPLETENESS AND POSSIBLE EXTENSIONS." Logical Methods in Computer Science (LMCS), vol. 22, no. 2, 2026, p. 1, https://doi.org/10.46298/LMCS-22(2:5)2026.