Formal Language and Automata

>> Experienced Tutor << >> Excellent Computer Science and Mathematics Background << Dear sir, I am an expert in Computer Science and Mathematics. I have completed my B.Sc.(Engg.) and M.Sc.(Engg.) in Computer Science and Engineering. In engineering, I studied "Theory of Computation" with 9 credits devoted and there were 4 courses. I learnt: [login to view URL] Automata. [login to view URL] Finite Automata. 3.Non-deterministic Finite Automata. [login to view URL] Definitions of DFA, NFA. [login to view URL] Finite Automata. [login to view URL] of NFA an DFA. [login to view URL] of NFA and DFA. [login to view URL] of NFA and DFA. [login to view URL] Expressions. [login to view URL] Operations and Closures. [login to view URL] and DFA to Regular Expression Conversion. [login to view URL] Languages. 13.Non-Regular Languages. [login to view URL] lemma. [login to view URL] Free Grammers. [login to view URL] of Context Free Grammers. 17.Ambiguity. [login to view URL] of CFG: Chomsky Normal Form. [login to view URL] of CFG: Greiback Normal Form. [login to view URL] Down Automata: single stack, multi stack. [login to view URL] of PDA and CFG. [login to view URL] definition of PDA and CFG. [login to view URL] Machine: Single Tape, Multi Tape, Multi Stack, Multi Track. [login to view URL] definition of Turing Machine. [login to view URL] of Turing Machine. My related few projects : https://www.freelancer.com/projects/computer-science/Theory-Computation-expert-needed/details https://www.freelancer.com/projects/computer-science/need-some-experts-work-with/details I can start right now. So, let's talk and get started. With best regards, Musfiq Mridha.