On the length of uncompletable words in unambiguous automata - Boccuto, Antonio; Carpi, Arturo (RAIRO. Informatique théorique et applications, 2019)
Keywords: 68Q45; 68Q70; complete automaton; Monoids; relatively maximal row; Unambiguous automaton; uncompletable word; Upper bounds