Michael Rabin
(2 articles)
1956
FSA
Finite State Automata
Finite State Automata
Computational model that processes input sequences and transitions between a finite number of states according to a set of rules, typically used for recognizing patterns or designing digital circuits.
Generality: 760
1971
Computational Complexity Theory
A branch of theoretical computer science that focuses on classifying computational problems based on their inherent difficulty and the resources required to solve them.
Generality: 500