About me:

Current: Software Engineer
Past: Lecturer
Education: Masters in Computer Technology
Research: Metamorphic & Polymorphic Malware Analysis1
Programming Interests: Assembly, C, Python
Subjects of Interest: Theory of Computation, Computer Networks, Computer Security, Database Management System
Email: grijesh.mnit@gmail.com

Some helpful answers On THEORY OF COMPUTATION:

1. How to write regular expression for a DFA
2. How do you say "δ:Q×Σ→Q" in English?
3. Finding the complement of a DFA?
4. Constructing an equivalent Regular Grammar from a Regular Expression
5. Ambiguity in transition
6. is a* the same as (a*)*?
7. In context of regular expression: Is (AB)* = A*B*?
8. Is the language { 0ⁿ1ⁿ0^k | k != n} context free?
9. Regular Expression to DFA
10. In context of Chomshy classification of formal language
11. Tips for creating Context free grammar

My Facebook Application:

If you like ASCII art: Asiiflow