Abstract
Hyper-minimization aims to reduce the size of the representation of a language beyond the limits imposed by classical minimization. To this end, the hyper-minimal representation can represent a language that has a finite difference to the original language. The first hyper-minimization algorithm is presented for (bottom-up) deterministic tree automata, which represent the recognizable tree languages. It runs in time \({\cal O}(\ell m n)\), where ℓ is the maximal rank of the input symbols, m is the number of transitions, and n is the number of states of the input tree automaton.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Badr, A.: Hyper-minimization in O(n 2). Int. J. Found. Comput. Sci. 20(4), 735–746 (2009)
Badr, A., Geffert, V., Shipman, I.: Hyper-minimizing minimized deterministic finite state automata. RAIRO Theor. Inf. Appl. 43(1), 69–94 (2009)
Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata: Techniques and applications (2007), http://tata.gforge.inria.fr/
Gawrychowski, P., Jeż, A.: Hyper-minimisation Made Efficient. In: Královič, R., Niwiński, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 356–368. Springer, Heidelberg (2009)
Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)
Gécseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, ch. 1, pp. 1–68. Springer (1997)
Högberg, J., Maletti, A., May, J.: Backward and forward bisimulation minimization of tree automata. Theoret. Comput. Sci. 410(37), 3539–3552 (2009)
Holzer, M., Maletti, A.: An n logn algorithm for hyper-minimizing a (minimized) deterministic automaton. Theoret. Comput. Sci. 411(38-39), 3404–3413 (2010)
Hopcroft, J.E.: An n logn algorithm for minimizing states in a finite automaton. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, pp. 189–196. Academic Press (1971)
Hosoya, H.: Foundations of XML Processing: The Tree-Automata Approach. Cambridge University Press (2011)
Knight, K.: Capturing practical natural language transformations. Machine Translation 21(2), 121–133 (2007)
Maletti, A.: Notes on hyper-minimization. In: Proc. 13th Int. Conf. Automata and Formal Languages, pp. 34–49. Nyíregyháza College (2011)
Maletti, A., Quernheim, D.: Hyper-minimisation of deterministic weighted finite automata over semifields. In: Proc. 13th Int. Conf. Automata and Formal Languages, pp. 285–299. Nyíregyháza College (2011)
Maletti, A., Quernheim, D.: Optimal hyper-minimization. Int. J. Found. Comput. Sci. 22(8), 1877–1891 (2011)
Schewe, S.: Beyond hyper-minimisation — minimising DBAs and DPAs is NP-complete. In: Proc. 30th Int. Conf. Foundations of Software Technology and Theoretical Computer Science. LIPIcs, vol. 8, pp. 400–411. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146–160 (1972)
Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, ch. 2, pp. 41–110. Springer (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jeż, A., Maletti, A. (2012). Hyper-minimization for Deterministic Tree Automata. In: Moreira, N., Reis, R. (eds) Implementation and Application of Automata. CIAA 2012. Lecture Notes in Computer Science, vol 7381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31606-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-31606-7_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31605-0
Online ISBN: 978-3-642-31606-7
eBook Packages: Computer ScienceComputer Science (R0)