Talk:Tree automaton

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles 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.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

Mid

This article has been rated as Mid-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Untitled comment

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

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

unary?

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

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

External links modified

Hello fellow Wikipedians,

I have just added archive links to one external link on Tree automaton. Please take a moment to review my edit. If necessary, add {{cbignore}} after the link to keep me from modifying it. Alternatively, you can add {{nobots|deny=InternetArchiveBot}} 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 {{Sourcecheck}}).

Y An editor has reviewed this edit and fixed any errors that were found.

If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—^{cyberbot II}_{Talk to my owner:Online} 00:26, 24 March 2016 (UTC)[reply]

History

My father, John E. Doner, invented tree automata in 1965, and he has made it known to me that he'd very much like it wikipedia acknowledged this fact. Not being a mathematician myself, I'm not eager to just edit the entry directly, so I'm hoping someone reads this and can help me out. I gather that in the past there was some issue with needing a citation for this; he sent me a PDF of the Notices of the American Mathematical Society Volume 12, Number 7 Issue 85 November 1965, and pointed out that immediately after the item about his work (65T-468 on pg. 819), the next item (65T-469 on pg. 820) which is a very similar item by a different author (apparently they were at the same conference and were working on the same problem posed by someone there), includes the acknowledgement "This result was first obtained by J. E. Doner". Would this be a suitable citation for him being the inventor of tree automata? Mark T Doner (talk) 00:16, 30 May 2025 (UTC)[reply]

I am interested in this issue, and I found the 1965 full issue of AMS Notices via https://www.ams.org/cgi-bin/notices/nxgnotices.pl?fm=main&current=196511 . However, it will take me some time to understand the details. - Jochen Burghardt (talk) 11:19, 30 May 2025 (UTC)[reply]

@Jochen Burghardt for what it's worth, the "first obtained" quote I mentioned before comes from the item for Thatcher and Wright, the authors who are credited in the source you mentioned with independently inventing tree automata. I guess their work was independent, but there was some discussion at this conference, and they felt the need to acknowledge my dad (J.E. Doner) Mark T Doner (talk) 13:04, 30 May 2025 (UTC)[reply]

I also agree with David Eppstein (at Talk:Tree (automata theory)) that Engelfriet.2015 can be used as a supporting citation. - Jochen Burghardt (talk) 11:26, 30 May 2025 (UTC)[reply]

I got some more details from dad. The conference was in spring of 1965, before June, but he can't remember which one. John Addison posed the problem which tree acceptors were the solution. after dad presented his work, apparently M. O. Rabin made an announcement crediting him with solving the problem, and this announcement was published in the proceedings of the conference. Thatcher told dad he'd had a similar idea but hadn't been able to make it work, but after seeing dad's work he and Wright were able to move forward. If it were possible to figure out which conference this was at, and find the proceedings, would that be a source that could be credited on Wikipedia?Well, anyway, dad also said he finds what Engelfriet wrote about it acceptable (though to me it seems a bit sparse on details and perhaps poorly worded) Mark T Doner (talk) 18:22, 31 May 2025 (UTC)[reply]

~~Do you have your father's full paper available? It should contain a definition of tree automata, if I understood Theorem 1 (in the abstract) right.~~ I found it via Engelfriet: https://www.sciencedirect.com/science/article/pii/S0022000070800411 , as well as a Technical report at https://apps.dtic.mil/sti/pdfs/AD0701753.pdf . - Jochen Burghardt (talk) 20:38, 30 May 2025 (UTC)[reply]