English Computing the permanent Cited by user Jarble on 22 Jul 2019 In linear algebra, the computation of the permanent of a matrix is a problem that is thought to be more difficult than the computation of the determinant of a matrix…
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.
English Two-way deterministic finite automaton Cited by user TheoreticalComputerScientist on 11 Mar 2017 In computer science, in particular in automata theory, an automaton is called two-way if it is allowed to re-read its input.