<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments for Chad Salinas Computer Science Scratch Pad</title>
	<atom:link href="http://chadsalinas.wordpress.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://chadsalinas.wordpress.com</link>
	<description>Cool Computer Science and Math Puzzles</description>
	<lastBuildDate>Sat, 07 Jun 2008 15:29:46 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on Pumping Lemma by Mike Godfrey</title>
		<link>http://chadsalinas.wordpress.com/2008/04/25/pumping-lemma/#comment-5</link>
		<dc:creator>Mike Godfrey</dc:creator>
		<pubDate>Sat, 07 Jun 2008 15:29:46 +0000</pubDate>
		<guid isPermaLink="false">http://chadsalinas.wordpress.com/?p=21#comment-5</guid>
		<description>The Pumping Lemma is useful for disproving the &lt;a href=&quot;http://en.wikipedia.org/wiki/Pumping_lemma_for_regular_languages&quot; title=&quot;wikipedia ref&quot; rel=&quot;nofollow&quot;&gt;regularity&lt;/a&gt; of a language.  It states that for strings beyond a certain length in your infinite-sized regular language, you are bound to find repeating strings in the form xy^i z, where xyz is in your language already.

It&#039;s useful, because if the pumping lemma applies to a language, you know that it&#039;s regular.  If the pumping lemma does not apply to an infinite language, you only know that the pumping lemma does not apply to that language.</description>
		<content:encoded><![CDATA[<p>The Pumping Lemma is useful for disproving the <a href="http://en.wikipedia.org/wiki/Pumping_lemma_for_regular_languages" title="wikipedia ref" rel="nofollow">regularity</a> of a language.  It states that for strings beyond a certain length in your infinite-sized regular language, you are bound to find repeating strings in the form xy^i z, where xyz is in your language already.</p>
<p>It&#8217;s useful, because if the pumping lemma applies to a language, you know that it&#8217;s regular.  If the pumping lemma does not apply to an infinite language, you only know that the pumping lemma does not apply to that language.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Worst Case &amp; Asymptotic Analysis by John Williams</title>
		<link>http://chadsalinas.wordpress.com/2007/07/05/worst-case-asymptotic-analysis/#comment-3</link>
		<dc:creator>John Williams</dc:creator>
		<pubDate>Wed, 11 Jul 2007 19:17:57 +0000</pubDate>
		<guid isPermaLink="false">http://chadsalinas.wordpress.com/2007/07/05/worst-case-asymptotic-analysis/#comment-3</guid>
		<description>You can put text in the middle of a LaTex equation that is not italicized using the \text{insert this regular text here} command.  There are also specific commands to insert space in an equation, because spaces are ignored in the equation environment.  

$latex \Leftrightarrow \exists \, n_0 &gt; 0 \text{ and }c &gt;0\text{ s.t. }$

You could write

$latex f(n) \in O(g(n)) \text{ if and only if }(\exists c&gt;0)(\exists n_0 &gt; 0)(\forall n&gt;n_0)(0 \leq f(n) \leq c \cdot g(n))$

for example.</description>
		<content:encoded><![CDATA[<p>You can put text in the middle of a LaTex equation that is not italicized using the \text{insert this regular text here} command.  There are also specific commands to insert space in an equation, because spaces are ignored in the equation environment.  </p>
<p><img src='http://s1.wordpress.com/latex.php?latex=%5CLeftrightarrow+%5Cexists+%5C%2C+n_0+%3E+0+%5Ctext%7B+and+%7Dc+%3E0%5Ctext%7B+s.t.+%7D&#038;bg=ffffff&#038;fg=333333&#038;s=0' alt='\Leftrightarrow \exists \, n_0 &gt; 0 \text{ and }c &gt;0\text{ s.t. }' title='\Leftrightarrow \exists \, n_0 &gt; 0 \text{ and }c &gt;0\text{ s.t. }' class='latex' /></p>
<p>You could write</p>
<p><img src='http://s2.wordpress.com/latex.php?latex=f%28n%29+%5Cin+O%28g%28n%29%29+%5Ctext%7B+if+and+only+if+%7D%28%5Cexists+c%3E0%29%28%5Cexists+n_0+%3E+0%29%28%5Cforall+n%3En_0%29%280+%5Cleq+f%28n%29+%5Cleq+c+%5Ccdot+g%28n%29%29&#038;bg=ffffff&#038;fg=333333&#038;s=0' alt='f(n) \in O(g(n)) \text{ if and only if }(\exists c&gt;0)(\exists n_0 &gt; 0)(\forall n&gt;n_0)(0 \leq f(n) \leq c \cdot g(n))' title='f(n) \in O(g(n)) \text{ if and only if }(\exists c&gt;0)(\exists n_0 &gt; 0)(\forall n&gt;n_0)(0 \leq f(n) \leq c \cdot g(n))' class='latex' /></p>
<p>for example.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Equivalent Regular Expressions by John Williams</title>
		<link>http://chadsalinas.wordpress.com/2007/06/27/equivalent-regular-expressions/#comment-2</link>
		<dc:creator>John Williams</dc:creator>
		<pubDate>Wed, 27 Jun 2007 22:13:18 +0000</pubDate>
		<guid isPermaLink="false">http://chadsalinas.wordpress.com/2007/06/27/equivalent-regular-expressions/#comment-2</guid>
		<description>Ferret out??  I&#039;ve wondered about the origins of this idiom.  Do ferrets search?  Bloodhounds do.  Do ferrets retrieve?  Perhaps we could invent a new database model and call the UI Ferret?</description>
		<content:encoded><![CDATA[<p>Ferret out??  I&#8217;ve wondered about the origins of this idiom.  Do ferrets search?  Bloodhounds do.  Do ferrets retrieve?  Perhaps we could invent a new database model and call the UI Ferret?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
