You need to know the following to do the questions: DFA (Deterministic finite automaton), NFA (Nondeterministic finite automaton), PDA (Pushdown automaton), Pumping Lemma, CFL (Context-free language), Chomsky normal form, Turing machine.
There are 9 questions.
It is not very long if you know the material. I need it by April 11. It would be great if someone can do it for 30$.
Bu iş için 7 freelancer ortalamada $60 teklif veriyor
Hi, I have strong background in Theorical Computer Science. I just finished a course Computer Theory at Master's degree. Let me help you.
hello sir , I would be a very greatful to work on this project. Please do consider my bid. With regards, Mani
I am a Computer Scientist. I have a great background in Discreet Mathematics, Computability Theory, Compiler Building, Design and Analysis of Algorithms. I can help you in all the subjects you mention. I would like to Daha Fazla