Download citation

The complexity of concatenation on deterministic and alternating finite automata

RAIRO-Theor. Inf. Appl., (2019)
DOI: https://doi.org/10.1051/ita/2018011