Talk:Tree automaton

Untitled comment
This page clearly lacks examples —Preceding unsigned comment added by 129.199.158.42 (talk) 14:36, 8 February 2010 (UTC)

Untitled comment
In the definition of top-down and bottom up, both are defined as $$(Q, \Gamma, q_0, \delta, F).$$ but the $$\Gamma$$ symbol is never defined.

I wonder why. I suppose $$\Gamma$$ must be the alphabet of symbols over which the tree automaton is defined. Moreover, the definition given in this page doesn't seem to be consistent with the one given in the TATA link that seems to be the reference. If nobody objects, I will edit this page in a week to update the definitions to those given in Chapter 1 of TATA.(jabial)

I updated the page as promised. --Jabial 13:44, 20 April 2006 (UTC)

unary?
What is a "unary" state?? 160.114.140.149 (talk) 21:35, 15 September 2008 (UTC)

I think that the definition of "ranked alphabet" should be moved somewhere else (here?). 149.156.90.26 (talk) 12:34, 29 September 2009 (UTC)

External links modified
Hello fellow Wikipedians,

I have just added archive links to 1 one external link on Tree automaton. Please take a moment to review my edit. If necessary, add after the link to keep me from modifying it. Alternatively, you can add to keep me off the page altogether. I made the following changes:
 * Added archive http://web.archive.org/web/20101224013755/http://www.irisa.fr:80/celtique/genet/timbuk/ to http://www.irisa.fr/celtique/genet/timbuk/

When you have finished reviewing my changes, please set the checked parameter below to true or failed to let others know (documentation at ).

Cheers.—cyberbot II  Talk to my owner :Online 00:26, 24 March 2016 (UTC)