Live briefing
Everything about State complexity
State complexity is an area of theoretical computer science dealing with the size of abstract automata, such as different kinds of finite automata. The classical result in the area is that simulating an -state nondeterministic finite automaton by a deterministic finite automaton requires exactly states in the worst case. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: State complexityA 5-minute orientation
- Skim a recent paper: State dependence of Krylov complexity in 2d CFTsInfluential work since 2022
- Pick up a classic book: The sorrows of empireThe most-reprinted book on the subject
- Read the landmark paper: Minimum Complexity Echo State NetworkCited 647 times
- Go sideways: Unambiguous finite automatonA closely related topic
- Go sideways: Two-way finite automatonA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Minimum Complexity Echo State Network
Altered resting state complexity in schizophrenia
Complexity of excited-state dynamics in DNA
State complexity of combined operations
STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
State-complexity of finite-state devices, state compressibility and incompressibility
State complexity of power
The state complexity of and
🆕 Influential since 2022
State dependence of Krylov complexity in 2d CFTs
Quantum state complexity meets many-body scars
Resting state EEG complexity as a predictor of cognitive performance
On the computational complexity of the secure state-reconstruction problem
Condemned to complexity? Growing state activity and complex policy systems
📚 Books worth reading
The sorrows of empireChalmers A. Johnson, Tom Weiner · 2003
Addicted to warJoel Andreas · 1992
Lockdown AmericaChristian Parenti · 1999
Corporate WarriorsP. W. Singer · 2001
Defense addictionSanford Gottlieb · 1997
Education and IncarcerationErica R. Meiners, Maisha T. Winn · 2011
Building the Trident NetworkMaggie Mort · 2001
"Live from Cape Canaveral"Jay Barbree · 2007
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Unambiguous finite automaton In automata theory, an unambiguous finite automaton (UFA) is a nondeterministic finite automaton (NFA) such that each word has at most one accepting path…
- Two-way finite automaton In computer science, in particular in automata theory, a two-way finite automaton is a finite automaton that is allowed to re-read its input. A two-way…
- Self-verifying finite automaton In automata theory, a self-verifying finite automaton (SVFA) is a special kind of a nondeterministic finite automaton (NFA) with a symmetric kind of nondetermin…
- Giovanni Pighizzini Giovanni Pighizzini is an Italian theoretical computer scientist known for his work in formal language theory and particularly in state complexity of two-way…
- Nondeterministic finite automaton In automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source…
- Alternating finite automaton In automata theory, an alternating finite automaton (AFA) is a nondeterministic finite automaton whose transitions are divided into existential and universal…
- Kai Salomaa Kai Tapani Salomaa (born 9 February 1960) is a Finnish Canadian theoretical computer scientist, known for his numerous contributions to the state complexity…
- Powerset construction In the theory of computation and automata theory, the powerset construction or subset construction is a standard method for converting a nondeterministic…