<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Theory of computation - Page 8 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Theory_of_computation&amp;p=7">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Theory_of_computation&amp;p=9">3.Next</a>
</p>
<p>can be a finite representation of a formal language that may be an infinite set. Automata are used as theoretical models for computing machines, and are used for proofs about computability.</p>

<p><big> Formal language theory </big></p>
<p><a href="page.php?w=Image%3AChomsky-hierarchy.svg">thumb</a>Formal language theory is a branch of mathematics concerned with describing languages as a set of operations over an <a href="page.php?w=Alphabet_%28formal_languages%29">alphabet</a>. It is closely linked with automata theory, as automata are used to generate</p><p>
<a accesskey="1" href="page.php?w=Theory_of_computation&amp;p=7">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Theory_of_computation&amp;p=9">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
