|need help on tree automata firstname.lastname@example.org (Paul Johnston) (2000-02-27)|
|Re: need help on tree automata email@example.com (Christian Stapfer) (2000-03-06)|
|Re: need help on tree automata Burak.Emir@dimail.epfl.ch (Burak Emir) (2000-03-06)|
|From:||"Paul Johnston" <firstname.lastname@example.org>|
|Date:||27 Feb 2000 02:48:47 -0500|
I'm trying to figure out what 'tree automata' is all about, but information
is scarce or generally too theoretical for me.
I would really appreciate if someone could explain (in plain english):
(1) basic summary of what they are
(2) what their main strengths are
(3) what kinds of applications benefit / require them?
(4) how conceptually 'difficult' you think they are (i.e. is this truly
difficult or just always expressed in a very formal manner?)
Thanks very much,
Return to the
Search the comp.compilers archives again.