Theoretical Computer Science is the mathematical foundation of computing in all its forms. By being the foundation, it is also the starting point for new and more efficient methodologies of computation.
Automata Theory
Finite State Automata,
Finite State Transducers,
Linear Bounded Automata,
Mealy and Moore Machines,
Pushdown Automata,
More »
Complexity Theory
The study of algorithmic complexity. A topic of particular interest is the relationship between polynomial-time (P) and non-deterministic polynomial-time (NP), the latter consisting of algorithms for which there is a P solution given the right initial guess (often called witness or certificate).
Conferences,
People,
Publications,
More »
Conferences
The conferences of Theoretical Computer Science.
More »
Formal Language Theory
Formal language theory is defined to be the study of sets of words over finite alphabets.
Context Free Languages,
Context Sensitive Languages,
Recursively Enumerable Languages,
Regular Languages,
More »
Forums and Networks
Online Forums and Networks discussiong aspects of Theoretical Computer Science.
More »
Journals
Important journals of theoretical computer science.
More »
People
The people actively involved in research in theoretical computer science.
Mailing Lists and Name Directories,
Students,
More »
Quantum Computing
Research Groups,
Simulators and Programming Languages,
More »
Research Groups
Academic Research Groups in Theoretical Computer Science.
More »
Software
Softwares related to theoretical computer science.
More »