论文信息 - On the structure of graphs in the Caucal hierarchy

On the structure of graphs in the Caucal hierarchy

We investigate the structure of graphs in the Caucal hierarchy. We provide criteria concerning the degree of vertices or the length of paths which can be used to show that a given graph does not belong to a certain level of this hierarchy. Each graph in the Caucal hierarchy corresponds to the configuration graph of some higher-order pushdown automaton. The main part of the paper consists of a study of such configuration graphs. We provide tools to decompose and reassemble their runs, and we prove a pumping lemma for higher-order pushdown automata.

Achim Blumensath

[1] Werner Damm,et al. An Automata-Theoretical Characterization of the OI-Hierarchy , 1986, Inf. Control..

[2] Achim Blumensath. Structures of bounded partition width , 2003 .

[3] Takeshi Hayashi. On Derivation Trees of Indexed Grammars —An Extension of the uvwxy-Theorem— , 1973 .

[4] Alexei L. Semenov,et al. Decidability of Monadic Theories , 1984, MFCS.

[5] Igor Walukiewicz. Monadic second-order logic on tree-like structures , 2002, Theor. Comput. Sci..

[6] Didier Caucal. On Infinite Terms Having a Decidable Monadic Theory , 2002, MFCS.

[7] Arnaud Carayol,et al. The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata , 2003, FSTTCS.

[8] Dietmar Berwanger,et al. The Monadic Theory of Tree-like Structures , 2001, Automata, Logics, and Infinite Games.

[9] Géraud Sénizergues,et al. L(A)=L(B)? A simplified decidability proof , 2002, Theor. Comput. Sci..

[10] Stephan Kreutzer,et al. An Extension of Muchnik's Theorem , 2005, J. Log. Comput..