1 Answers
State complexity is an area of theoretical computer sciencedealing with the size of abstract automata,such as different kinds of finite automata.The classical result in the area is thatsimulating an n {\displaystyle n} -statenondeterministic finite automatonby a deterministic finite automatonrequires exactly 2 n {\displaystyle 2^{n}} states in the worst case.
4 views
Answered