NOTE: This gig is related to mathematical treatment of the theory of computation only.
I not only offer the cliche solutions, I will also provide you with the detailed mathematical background of the problem you are facing, the road map en route to solution and finally the satisfactorily detailed solution. The main topics of my interest are as follows:
- Regular Expressions and Languages
- Deterministic Finite Automata (Finite State Machines)
- Non-Deterministic Finite Automata
- Pumping Lemma
- Minimization of Automata
- Pushdown Automata
- Context Free Grammars
- Turing Machines
- Time Complexity
- Space Complexity
If you feel any sort of difficulty in any problem(s) related to following list of the topics, you should feel yourself in the safe zone when you are here. Even if your major is computer science or any other applied field, you should feel quite comfortable to contact.
One basic gig deals with one standard problem.
Solution of one standard problem related to languages, FSMs, DFAs, NFAs and related topics.