Walter S. Brainerd (1968):
The Minimalization of Tree Automata.
Inform. and Control 13(5),
pp. 484–491,
doi:10.1016/S0019-9958(68)90917-0.
Jean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën & Djelloul Ziadi (2004):
Random Generation Models for NFAs.
J. Autom. Lang. Combin. 9(2/3),
pp. 203–216.
John Doner (1970):
Tree Acceptors and Some of Their Applications.
J. Comput. System Sci. 4(5),
pp. 406–451,
doi:10.1016/S0022-0000(70)80041-1.
Ferenc Gécseg & Magnus Steinby (1984):
Tree Automata.
Akadémiai Kiadó,
Budapest.
Ferenc Gécseg & Magnus Steinby (1997):
Tree Languages.
In: Grzegorz Rozenberg & Arto Salomaa: Beyond Words, chapter 1,
Handbook of Formal Languages 3.
Springer,
pp. 1–68,
doi:10.1007/978-3-642-59126-6_1.
Thomas Hanneforth (2010):
fsm2 — A Scripting Language Interpreter for Manipulating Weighted Finite-State Automata.
In: Proc. FSMNLP,
LNCS 6062.
Springer,
pp. 13–30,
doi:10.1007/978-3-642-14684-8_3.
Ondrej Lengál, JiríSimácek & Tomás Vojnar (2012):
VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata.
In: Proc. TACAS,
LNCS 7214.
Springer,
pp. 79–94,
doi:10.1007/978-3-642-28756-5_7.
Ted Leslie (1995):
Efficient Approaches to Subset Construction.
Technical Report.
University of Waterloo, Canada.
Jonathan May & Kevin Knight (2006):
Tiburon: A Weighted Tree Automata Toolkit.
In: Proc. CIAA,
LNCS 4094.
Springer,
pp. 102–113,
doi:10.1007/11812128_11.
Slav Petrov, Leon Barrett, Romain Thibaux & Dan Klein (2006):
Learning Accurate, Compact, and Interpretable Tree Annotation.
In: Proc. COLING-ACL.
Association for Computational Linguistics,
pp. 433–440,
doi:10.3115/1220175.1220230.
Sheng Yu (1997):
Regular Languages.
In: Grzegorz Rozenberg & Arto Salomaa: Word, Language, Grammar, chapter 2,
Handbook of Formal Languages 1.
Springer,
pp. 41–110,
doi:10.1007/978-3-642-59136-5_2.
Lynette van Zijl (1997):
Generalized Nondeterminism and the Succinct Representation of Regular Languages.
Stellenbosch University, South Africa.