Name
Abstract | ||
|---|---|---|
We present two algorithms for minimizing deterministic frontier-to-root tree automata (DFRTAS) and compare them with their string counterparts. The presentation is incremental, starting out from definitions of minimality of automata and state equivalence, in the style of earlier algorithm taxonomies by the authors. The first algorithm is the classical one, initially presented by Brainerd in the 1960s and presented (sometimes imprecisely) in standard texts on tree language theory ever since. The second algorithm is completely new. This algorithm, essentially representing the generalization to ranked trees of the string algorithm presented by Watson and Daciuk, incrementally minimizes a DFRTA. AS a result, intermediate results of the algorithm can be used to reduce the initial automaton's size. This makes the algorithm useful in situations where running time is restricted (for example, in real-time applications). We also briefly sketch how a concurrent specification of the algorithm in CSP can be obtained from an existing specification for the DFA case. |
Year | Venue | Keywords |
|---|---|---|
2009 | PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2009 | deterministic frontier-to-root tree automata, deterministic bottom-up tree automata, minimization, minimality |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
1 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Loek G. Cleophas | 1 | 45 | 11.31 |
| Derrick G. Kourie | 2 | 223 | 33.10 |
| Tinus Strauss | 3 | 12 | 5.35 |
| Bruce W. Watson | 4 | 338 | 53.24 |