APA (7th ed.) Citation

Morita, K. (2015). Universal Reversible Turing Machines with a Small Number of Tape Symbols. Fundamenta Informaticae, 138(1-2), 17. https://doi.org/10.3233/FI-2015-1195

Chicago Style (17th ed.) Citation

Morita, Kenichi. "Universal Reversible Turing Machines with a Small Number of Tape Symbols." Fundamenta Informaticae 138, no. 1-2 (2015): 17. https://doi.org/10.3233/FI-2015-1195.

MLA (9th ed.) Citation

Morita, Kenichi. "Universal Reversible Turing Machines with a Small Number of Tape Symbols." Fundamenta Informaticae, vol. 138, no. 1-2, 2015, p. 17, https://doi.org/10.3233/FI-2015-1195.