P problems :
1. Reachablitity problem
2. Eulers problem
3. whether to DFA are equivalent i.e. Is L(D1) = L(D2) ? where D1,D2 are Deterministic finite state automaton
4. 2-SAT problem
NP problems:
1 All P and NP-Complete problems are NP
2 Whether two NDFA are equivalent i.e. Is L(N1) = L(N2) ? Where N1,N2 are Non Deterministic Finite State automaton
3. Whether two Regular Expressions are equivalent i.e. Is L(R1) = L(R2) ? where R1,R2 are regular expressions
NP-complete problems
1. Bounded Tiling
2. SAT
3. C-SAT
4. 3-SAT, MAX-SAT
5. Directed Hamiltonian, Undirected Hamiltonian, Hamiltonian Circuit
6 Independent Set
7. Node Covering
8. Knapsack problem
9. Coloring problem
10. Subgraph Isomorphism
Still there are lot, but i think i covered most of them.