Hyper-minimization for deterministic tree automata

Authors:
Artur Jeż/;Andreas Maletti
Affiliations:
Institute of Computer Science, University of Wroc$#322/aw, Wroc$#322/aw, Poland;Institute for Natural Language Processing, Universitä/t Stuttgart, Stuttgart, Germany
Venue:
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Year:
2012

Citing 7
Cited 1

Regular languages

Handbook of formal languages, vol. 1
Tree languages

Handbook of formal languages, vol. 3
Capturing practical natural language transformations

Machine Translation
Hyper-minimisation Made Efficient

MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Backward and forward bisimulation minimization of tree automata

Theoretical Computer Science
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton

Theoretical Computer Science
Foundations of XML Processing: The Tree-Automata Approach

Foundations of XML Processing: The Tree-Automata Approach

Hyper-optimization for deterministic tree automata

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

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.