
Theory of Computation Theoretical Computer Science  Automata Theory, Computability Theory, and Computational Complexity Theory 
 LinkBack  Thread Tools  Display Modes 
September 3rd, 2008, 11:51 AM  #1 
Joined: Sep 2008 Posts: 1  Automata Theory
Hi, first of all, sorry about my english if it's not perfect. I need your help to know what kind of languages are the next ones (regular, contextfree,...) : L1= {(a+b)^n b^j a^k  j+k < n < 2(j+k); n, j, k >= 0 } L2={(a+b)^n b^j a^k  n odd, j+k is even; n, j, k >=0} L3={(a+b)^n b^j a^k  j<n<2j, j<k<2j, j<n+k<3j; n,j,k>=0} Thanks, Tomas. 
My Computer Forum is free to register and we welcome everyone! 
November 13th, 2008, 11:17 AM  #2 
Joined: Nov 2008 Posts: 1  Automata Theory
hello ,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... 
October 30th, 2009, 12:30 AM  #3 
Joined: Oct 2009 Posts: 13  Re: Automata Theory
it is an expression of advanced mathsmatics.


Tags 
automata, theory 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Theory of Computation  Amina  Theory of Computation  0  October 27th, 2013 06:12 AM 
theory of computation sipser problems  farazch  Theory of Computation  8  April 21st, 2012 09:08 PM 
Research topics in Automata Theory and Computations  sanjay kumar  Theory of Computation  0  March 27th, 2012 09:18 PM 
Micheal Sipser  Theory of Computation 2nd ed. Solutions  AlienX  Theory of Computation  0  September 26th, 2011 12:33 AM 
Thread Theory  asbo  OS Architecture  0  April 30th, 2010 11:07 AM 