Properties of Regular Languages

Hi. I was receiving excellent marks for such things when I was in university. I have reviewd your asignment and looks like I can deal with it - I already made some thaughts in my mind how it can be solved. I placed a low bid as I am newbie on Freelancer and now need to receive good reviews more than extra bucks. Here is an example of 18a: L1 = (a U b)* - any word from {a, b} L2 can be any non-regular language L1 U L2 will be the same as L1, which is regular

hi. I can do these problems easily.

I am instructor of Theory of Automata/Computational theory. I have excellent concepts of ,Regular Languages, Nondeterminism, Regular Expressions,Nonregular Languages, Context-Free Languages, Context-free Grammars, Pushdown Automata, Non-context-free Languages, The Church-Turing Thesis,Turing MachinesVariants of Turing Machines,Decidability,Decidable Languages,The Halting Problem,Reducibilit and Time Complexity. PLEASE see my PROFILE and REVIES as well. Thank You

Hi, I have strong background in regular languages and experience in theory of computation. Let me help you. I am ready to start.

Hello