Talk:Tree automaton

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computing  
WikiProject icon This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
 ???  This article has not yet received a rating on the project's quality scale.
 ???  This article has not yet received a rating on the project's importance scale.

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

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)


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

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