An implementation of deterministic tree automata minimization

Authors:
Rafael C. Carrasco;Jan Daciuk;Mikel L. Forcada
Affiliations:
Dep. de Lenguajes y Sistemas Informáticos, Universidad de Alicante, Alicante, Spain;Knowledge Engineering Department, Gdańsk University of Technology, Gdańsk, Poland;Dep. de Llenguatges i Sistemes informàtics, Universitat d'Alacant, Alacant, Spain
Venue:
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Year:
2007

Citing 4
Cited 0

Three partition refinement algorithms

SIAM Journal on Computing
An O(n log n) implementation of the standard method for minimizing n-state finite automata

Information Processing Letters
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Building a large annotated corpus of English: the penn treebank

Computational Linguistics - Special issue on using large corpora: II

Quantified Score

Hi-index	0.00

Visualization

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 O(|A|2), with |A| being the size of the DTA.