automata help

hi friends out there i am working for a company it is working on a big automata project i have been assigned to search online help for making this project company will be providing good fees arond 200 to 3000$ but before that i have to test weather he is effiecient in this field or not plz mail me with the answer of these two question i will judge the godd one & hire him up with the assignement do reply soon here the questions 1. Given that we cannot decide if 1 Turing Machine accepts everything, prove that we cannot decide if 2 Turing Machines accept the same language. 2. Find a polynomial time reduction to map the language Even length Palindromes using only the letters {a,b} into DoubleWord using only the letters {a,b} Even Length Palindromes over {a,b}= { ë, aa,bb,aaaa,abba,baab,bbbb,aaaaaa,abaaba,?.} DoubleWord over {a,b}= { ë, aa,bb,aaaa,abab,baba,bbbb,aaaaaa,abbabb,?.} ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased. ## Platform automata