RAIRO - Theoretical Informatics and Applications (RAIRO: ITA)

The complexity of concatenation on deterministic and alternating finite automata

Michal Hospodár and Galina Jirásková

RAIRO-Theor. Inf. Appl., 52 2-3-4 (2018) 153-168

Published online: 24 January 2019

DOI: 10.1051/ita/2018011

Michal Hospodár

Galina Jirásková

Articles written by ALL the selected authors (AND)

Articles written by ANY OF the selected authors (OR)