Most complex deterministic union-free regular languages
From MaRDI portal
Publication:777986
DOI10.1007/978-3-319-94631-3_4zbMath1435.68150arXiv1711.09149MaRDI QIDQ777986
Janusz A. Brzozowski, Sylvie Davies
Publication date: 30 June 2020
Full work available at URL: https://arxiv.org/abs/1711.09149
regular language; transition semigroup; state complexity; reversal; Boolean operation; syntactic semigroup; different alphabets; one-cycle-free-path automaton; union-free language