-----------------------------------

yaprak

Thu Nov 13, 2008 3:44 pm


automata theory help

-----------------------------------

first ı am sorry,ı could not find suitable topic, so ı post my question here.

could you help me to solve this problem ,ı must  prove that 
{b^2i a^3j c^k :   i,j,k integers and  i>=j >k } is not regular language 

thanks for your help...


-----------------------------------

OneOffDriveByPoster

Thu Nov 13, 2008 5:40 pm


Re: automata theory help

-----------------------------------

http://en.wikipedia.org/wiki/Pumping_lemma_for_regular_languages