State complexity of unambiguous operations on finite automata

DOI10.1016/j.tcs.2019.04.008zbMath1435.68170MaRDI QIDQ2334604

Alexander Okhotin, Galina Jirásková

Publication date: 7 November 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.04.008

zbMATH Keywords

state complexity; disjoint union; unambiguous concatenation; unambiguous star

Mathematics Subject Classification ID

68Q45: Formal languages and automata