6 citations · 12 across the 7 of their papers we have counts for
1 paper · 1 filter
Achilles A. Beros, Bjørn Kjos-Hanssen, Daylan Kaui Yogi
We show that the digraph of a nondeterministic finite automaton witnessing the automatic complexity of a word can always be taken to be planar. In the case of total transition func…