APA (7th ed.) Citation

Kontorovich, A., & Trachtenberg, A. (2014). Deciding unique decodability of bigram counts via finite automata. Journal of computer and system sciences, 80(2), 450-456. https://doi.org/10.1016/j.jcss.2013.09.003

Chicago Style (17th ed.) Citation

Kontorovich, Aryeh, and Ari Trachtenberg. "Deciding Unique Decodability of Bigram Counts via Finite Automata." Journal of Computer and System Sciences 80, no. 2 (2014): 450-456. https://doi.org/10.1016/j.jcss.2013.09.003.

MLA (9th ed.) Citation

Kontorovich, Aryeh, and Ari Trachtenberg. "Deciding Unique Decodability of Bigram Counts via Finite Automata." Journal of Computer and System Sciences, vol. 80, no. 2, 2014, pp. 450-456, https://doi.org/10.1016/j.jcss.2013.09.003.