The complexity of concatenation on deterministic and alternating finite automataMichal Hospodár and Galina JiráskováRAIRO-Theor. Inf. Appl., 52 2-3-4 (2018) 153-168DOI: https://doi.org/10.1051/ita/2018011
