Jump to content

英文维基 | 中文维基 | 日文维基 | 草榴社区

Talk:Regular tree grammar

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

What is ??

[edit]

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)[reply]


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)[reply]