We investigate the linear orders belonging to the pushdown hierarchy. Our results are based on the characterization of the pushdown hierarchy by graph transformations due to Caucal and do not make any use of higher-order pushdown automata machincry. Our main results show that ordinals belonging to the rt-th level are exactly those strictly smaller than the tower of ω of height n + 1. More generally the Hausdorff rank of scattered linear orders on the n-th level is strictly smaller than the tower of ω of height n. As a corollary the Cantor-Bendixson rank of the tree solutions of safe recursion schemes of order n is smaller than the tower of ω of height n. As a spin-off result, we show that the ω-words belonging to the second level of the pushdown hierarchy are exactly the morphic words.
展开▼
