Algorithms for acceptance, pattern matching and parsing of regular trees and the tree automata used in these algorithms have many applications, including instruction selection in compilers, implementation of term rewriting systems, and model checking. Many such tree algorithms and constructions for such tree automata appear in the literature, but some deficiencies existed, including: inaccessibility of theory and algorithms; difficulty of comparing algorithms due to variations in presentation style and level of formality; and lack of reference to the theory in many publications. An algorithm taxonomy is an effective means of bringing order to such a field. We report on two taxonomies of regular tree algorithms that we have constructed to deal with the deficiencies. The complete work has been presented in the PhD thesis of the first author.
|Title of host publication||Proceedings of the Prague Stringology Conference 2009 (PSC'09, Prague, Czech Republic, August 31-September 2, 2009)|
|Editors||J. Holub, J. Zdarek|
|Place of Publication||Prague|
|Publisher||Czech Technical University in Prague|
|Publication status||Published - 2009|