<?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="Tree-adjoining grammar - Page 4 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Tree-adjoining_grammar&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Tree-adjoining_grammar&amp;p=5">3.Next</a>
</p>
<p>avoiding the limitations of rewrite systems entirely.</p>

<p><big>Description</big></p>
<p>A TAG can be defined as a 5-<a href="page.php?w=tuple">tuple</a>  with:</p>

<p>
*  as the <a href="page.php?w=finite_set">finite set</a> of <a href="page.php?w=Terminal_symbol">terminal symbols</a>;<br/>
*  as the finite set of non-terminal symbols, disjunct from ;<br/>
*  as a finite set of finite trees called initial trees;<br/>
** Initial trees have non-terminals as inner nodes. The frontier can consist of terminals and non-terminals. Non-terminals at the frontier</p><p>
<a accesskey="1" href="page.php?w=Tree-adjoining_grammar&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Tree-adjoining_grammar&amp;p=5">3.Next</a>
</p>

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

</card>
</wml>
