My Math Forum Automata question

 Computer Science Computer Science Forum

 December 12th, 2015, 01: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

 Tags automata, question

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post Saman Q Computer Science 2 November 8th, 2015 01:42 AM taih Applied Math 1 December 22nd, 2013 12:17 PM BenFRayfield Number Theory 0 July 30th, 2013 08:32 AM MrPhil Computer Science 0 August 30th, 2012 11:48 PM Phrzby Phil Computer Science 0 June 12th, 2007 11:02 AM

 Contact - Home - Forums - Cryptocurrency Forum - Top