Talk:Regular tree grammar
Jump to navigation
Jump to search
This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||||||||||||||||||||||
|
What is ??
T_\Sigma (N) is used but not defined in the current article! —Preceding unsigned comment added by 93.148.179.121 (talk) 14:15, 19 January 2009 (UTC)
Indeed! I tried to make an educated guess about the meaning of but couldn't come up with anything for which I had enough confidence to submit. Is it the set of trees with internal nodes from and leaves from ? That makes the whole grammar seem more like a CFG than anything remotely regular. The lack of this definition is a glaring hole in this article. Help would be appreciated. 19:04, 14 April 2009 (UTC)
- Added def. of and some more missing explanations, adapted from the book from Tree Automata Techniques and Applications. Also added an example and stated the main closure properties in 2 new sections. Jochen Burghardt (talk) 18:55, 9 May 2013 (UTC)