English Complementation of automata Cited by user A3nm on 13 Dec 2023 In theoretical computer science and formal language theory, the complementation of an automaton is the problem of computing an automaton that accepts precisely the words…
French Complexité en états Cited by user ManiacParisien on 15 Jul 2017 La complexité en états est un thème en informatique théorique qui traite de la taille d'automates abstraits, tels que les diverses variantes des automates finis…
English State complexity Cited by user TheoreticalComputerScientist on 22 Mar 2017 State complexity is an area of theoretical computer science dealing with the size of abstract automata, such as different kinds of finite automata.