%0 Journal Article
%A Hospodár, Michal
%A Jirásková, Galina
%T The complexity of concatenation on deterministic and alternating finite automata
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2018
%P 153-168
%V 52
%N 2-3-4
%I EDP-Sciences
%U http://archive.numdam.org/articles/10.1051/ita/2018011/
%R 10.1051/ita/2018011
%G en
%F ITA_2018__52_2-3-4_153_0