ALAJAJI, John und SALOMAA, Kai, 2025. Maximal universal width of an AFA is NP-hard. Theoretical Computer Science. 11 August 2025. Vol. 1045, , p. N.PAG-0. DOI 10.1016/j.tcs.2025.115280.
Elsevier - Harvard (with titles)Alajaji, J., Salomaa, K., 2025. Maximal universal width of an AFA is NP-hard. Theoretical Computer Science 1045, N.PAG-0. https://doi.org/10.1016/j.tcs.2025.115280
American Psychological Association 7th editionAlajaji, J., & Salomaa, K. (2025). Maximal universal width of an AFA is NP-hard. Theoretical Computer Science, 1045, N.PAG-0. https://doi.org/10.1016/j.tcs.2025.115280
Springer - Basic (author-date)Alajaji J, Salomaa K (2025) Maximal universal width of an AFA is NP-hard.. Theoretical Computer Science 1045:N.PAG-0. https://doi.org/10.1016/j.tcs.2025.115280
Juristische Zitierweise (Stüber) (Deutsch)Alajaji, John/ Salomaa, Kai, Maximal universal width of an AFA is NP-hard., Theoretical Computer Science 2025, N.PAG-0.