December 12th, 2015, 02:57 AM  #1 
Member Joined: Mar 2015 From: USA Posts: 34 Thanks: 1  Automata question
The question: Let it be $L$ a regular language. few definitions: $p(L)$the minimal natural number so that $L$ fulfill the pumping lemma. $n(L)$ minimal NFA that accepts $L$. $m(L)$ $Rank(L)$, the number of equivalence classes in $L$. Let it be integer $k>0$. find an example for a language $L$ so that: $p=n=m=k$. My attempt: At start, thought of $L=\{w: w\bmod k=0\}$, $\Sigma=\{ a\}$. But then I realized that $p<k$. And also for every $L$ that I choose here, I don't know how exactly to prove that the $NFA$ which accepts it is minimal. I know how to do this only on $NFA$'s with one or two states, but not on $NFA$'s with unknown number of states. How can I solve this? 

Tags 
automata, question 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Automata Question  Saman Q  Computer Science  2  November 8th, 2015 02:42 AM 
Automata  a question  taih  Applied Math  1  December 22nd, 2013 01:17 PM 
Elementary Cellular Automata are just the first layer  BenFRayfield  Number Theory  0  July 30th, 2013 09:32 AM 
Construction of Deterministic Finite Automata  MrPhil  Computer Science  0  August 31st, 2012 12:48 AM 
Linear Bounded Automata  Phrzby Phil  Computer Science  0  June 12th, 2007 12:02 PM 