An Implementation of Deterministic Tree Automata Minimization

  • Rafael C. Carrasco
  • Jan Daciuk
  • Mikel L. Forcada
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4783)

Abstract

A frontier-to-root deterministic finite-state tree automaton (DTA) can be used as a compact data structure to store collections of unranked ordered trees. DTAs are usually sparser than string automata, as most transitions are undefined and therefore, special care must be taken in order to minimize them efficiently. However, it is difficult to find simple and detailed descriptions of the minimization procedure in the published literature. Here, we fully describe a simple implementation of the standard minimization algorithm that needs a time in \(\mathcal{O}(|A|^2)\), with |A| being the size of the DTA.

Keywords

sminimal deterministic tree automata minimization of automata 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Brainerd, W.S.: The minimalization of tree automata. Information and Control 13(5), 484–491 (1968)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)Google Scholar
  3. 3.
    Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997) release (October 1rst, 2002), available on http://www.grappa.univ-lille3.fr/tata
  4. 4.
    Hopcroft, J., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison–Wesley, Reading (1979)MATHGoogle Scholar
  5. 5.
    Blum, N.: An O(n log n) implementation of the standard method for minimizing n-state finite automata. Information Processing Letters 57(2), 65–69 (1996)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Watson, B.W.: A taxonomy of finite automata minimization algorithmes. Computing Science Note 93/44, Eindhoven University of Technology, The Netherlands (1993)Google Scholar
  7. 7.
    Marcus, M.P., Santorini, B., Marcinkiewicz, M.: Building a large annotated corpus of english: the penn treebank. Computational Linguistics 19, 313–330 (1993)Google Scholar
  8. 8.
    Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Computing 16(6), 973–989 (1987)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Carrasco, R.C., Daciuk, J., Forcada, M.L.: Incremental construction of minimal tree automata (submitted, 2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Rafael C. Carrasco
    • 1
  • Jan Daciuk
    • 2
  • Mikel L. Forcada
    • 3
  1. 1.Dep. de Lenguajes y Sistemas Informáticos, Universidad de Alicante, E-03071 AlicanteSpain
  2. 2.Knowledge Engineering Department, Gdańsk University of Technology, Ul. G. Narutowicza 11/12, 80-952 GdańskPoland
  3. 3.Dep. de Llenguatges i Sistemes informàtics, Universitat d’Alacant, E-03071 AlacantSpain

Personalised recommendations