APA (7th ed.) Citation

Shojaei-Fard, A. (2022). Non-perturbative graph languages, halting problem and complexity. Forum Mathematicum, 34(5), 1159. https://doi.org/10.1515/forum-2021-0119

Chicago Style (17th ed.) Citation

Shojaei-Fard, Ali. "Non-perturbative Graph Languages, Halting Problem and Complexity." Forum Mathematicum 34, no. 5 (2022): 1159. https://doi.org/10.1515/forum-2021-0119.

MLA (9th ed.) Citation

Shojaei-Fard, Ali. "Non-perturbative Graph Languages, Halting Problem and Complexity." Forum Mathematicum, vol. 34, no. 5, 2022, p. 1159, https://doi.org/10.1515/forum-2021-0119.