Andrew Badr (2008):
Hyper-Minimization in O(n^2).
In: Proc. 13th CIAA,
LNCS 5148.
Springer,
pp. 223–231,
doi:10.1007/978-3-540-70844-5_23.
Andrew Badr (2009):
Hyper-Minimization in O(n^2).
Int. J. Found. Comput. Sci. 20(4),
pp. 735–746,
doi:10.1142/S012905410900684X.
Andrew Badr, Viliam Geffert & Ian Shipman (2009):
Hyper-minimizing minimized deterministic finite state automata.
RAIRO Theor. Inf. Appl. 43(1),
pp. 69–94,
doi:10.1051/ita:2007061.
Jean Berstel & Christophe Reutenauer (1982):
Recognizable Formal Power Series on Trees.
Theor. Comput. Sci. 18(2),
pp. 115–148,
doi:10.1016/0304-3975(82)90019-6.
Björn Borchardt (2003):
The Myhill-Nerode Theorem for Recognizable Tree Series.
In: Proc. 7th DLT,
LNCS 2710.
Springer,
pp. 146–158,
doi:10.1007/3-540-45007-6_11.
Björn Borchardt (2005):
The Theory of Recognizable Tree Series.
Technische Universität Dresden.
Walter S. Brainerd (1968):
The Minimalization of Tree Automata.
Information and Control 13(5),
pp. 484–491,
doi:10.1016/S0019-9958(68)90917-0.
Cezar Câmpeanu, Nicolae Santean & Sheng Yu (2001):
Minimal cover-automata for finite languages.
Theor. Comput. Sci. 267(1–2),
pp. 3–16,
doi:10.1016/S0304-3975(00)00292-9.
Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert & Robert Endre Tarjan (1994):
Dynamic Perfect Hashing: Upper and Lower Bounds.
SIAM J. Comput. 23(4),
pp. 738–761,
doi:10.1137/S0097539791194094.
Jason Eisner (2003):
Simpler and More General Minimization for Weighted Finite-State Automata.
In: Proc. HLT-NAACL.
The The Association for Computational Linguistics,
pp. 64–71.
Zoltán Fülöp & Heiko Vogler (2009):
Weighted tree automata and tree transducers.
In: Manfred Droste, Werner Kuich & Heiko Vogler: Handbook of Weighted Automata, chapter IX,
EATCS Monographs on Theoret. Comput. Sci..
Springer,
pp. 313–403,
doi:10.1007/978-3-642-01492-5_9.
PawełGawrychowski & Artur Jeż (2009):
Hyper-minimisation Made Efficient.
In: Proc. 34th MFCS,
LNCS 5734.
Springer,
pp. 356–368,
doi:10.1007/978-3-642-03816-7_31.
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: Handbook of Formal Languages, chapter 1 3.
Springer,
pp. 1–68,
doi:10.1007/978-3-642-59126-6_1.
Jonathan S. Golan (1999):
Semirings and their Applications.
Kluwer Academic,
Dordrecht,
doi:10.1007/978-94-015-9333-5.
David Gries (1973):
Describing an Algorithm by Hopcroft.
Acta Inform. 2(2),
pp. 97–109,
doi:10.1007/BF00264025.
Udo Hebisch & Hanns J. Weinert (1998):
Semirings — Algebraic Theory and Applications in Computer Science.
World Scientific,
doi:10.1142/9789812815965_0001.
Johanna Högberg, Andreas Maletti & Jonathan May (2009):
Backward and Forward Bisimulation Minimization of Tree Automata.
Theor. Comput. Sci. 410(37),
pp. 3539–3552,
doi:10.1016/j.tcs.2009.03.022.
Markus Holzer & Andreas Maletti (2010):
An n ologn Algorithm for Hyper-Minimizing a (Minimized) Deterministic Automaton.
Theor. Comput. Sci. 411(38–39),
pp. 3404–3413,
doi:10.1016/j.tcs.2010.05.029.
John E. Hopcroft (1971):
An n+.1667emlog+.1667em n Algorithm for Minimizing States in a Finite Automaton.
In: Theory of Machines and Computations.
Academic Press,
pp. 189–196.
Artur Jeż & Andreas Maletti (2013):
Hyper-minimization for deterministic tree automata.
Int. J. Found. Comput. Sci. 24(6),
pp. 815–830,
doi:10.1142/S0129054113400200.
Dexter Kozen (1992):
On the Myhill-Nerode theorem for trees.
Bulletin of the EATCS 47,
pp. 170–173.
Werner Kuich (1998):
Formal Power Series over Trees.
In: Proc. 3rd DLT.
Aristotle University of Thessaloniki,
pp. 61–101.
Andreas Maletti & Daniel Quernheim (2011):
Hyper-minimisation of deterministic weighted finite automata over semifields.
In: Proc. 13th AFL.
Nyíregyháza College,
pp. 285–299.
Andreas Maletti & Daniel Quernheim (2011):
Pushing for Weighted Tree Automata.
In: Proc. 36th MFCS,
LNCS 6907.
Springer,
pp. 460–471,
doi:10.1007/978-3-642-22993-0_42.
Mehryar Mohri (1997):
Finite-State Transducers in Language and Speech Processing.
Comput. Linguist. 23(2),
pp. 269–311.
Slav Petrov, Leon Barrett, Romain Thibaux & Dan Klein (2006):
Learning Accurate, Compact, and Interpretable Tree Annotation.
In: Proc. 44th ACL.
The Association for Computational Linguistics,
pp. 433–440,
doi:10.3115/1220175.1220230.
Daniel Quernheim (2010):
Hyper-minimisation of weighted finite automata.
Institut für Linguistik, Universität Potsdam.
Robert Endre Tarjan (1972):
Depth-First Search and Linear Graph Algorithms.
SIAM J. Comput. 1(2),
pp. 146–160,
doi:10.1137/0201010.
Antti Valmari & Petri Lehtinen (2008):
Efficient Minimization of DFAs with Partial Transition Functions.
In: Proc. 25th STACS,
LIPIcs 1.
Schloss Dagstuhl — Leibniz-Zentrum für Informatik, Germany,
pp. 645–656,
doi:10.4230/LIPIcs.STACS.2008.1328.
eptcs@eptcs.org