论文信息 - The Monadic Quantiier Alternation Hierarchy over Graphs Is Innnite

The Monadic Quantiier Alternation Hierarchy over Graphs Is Innnite

We show that the monadic second-order quantiier alternation hierarchy over nite directed graphs and over nite two-dimensional grids is innnite. For this purpose we investigate sets of grids where the width is a function in the height. The innniteness of the hierarchy is then witnessed by n-fold exponential functions for increasing integers n.

Wolfgang Thomasemail

[1] Johann A. Makowsky,et al. The Expressive Power of Transitive Closue and 2-way Multihead Automata , 1991, CSL.

[2] Johann A. Makowsky,et al. Arity vs. Alternation in Second Order Logic , 1994, LFCS.

[3] C. C. Elgot. Decision problems of finite automata design and related arithmetics , 1961 .

[4] Dora Giammarresi. Two-Dimensional Languages and Recognizable Functions , 1993, Developments in Language Theory.

[5] Ronald Fagin,et al. On Monadic NP vs. Monadic co-NP , 1995, Inf. Comput..

[6] Michel Latteux,et al. Recognizable Picture Languages and Domino Tiling , 1997, Theor. Comput. Sci..

[7] Wolfgang Thomas,et al. Classifying Regular Events in Symbolic Logic , 1982, J. Comput. Syst. Sci..

[8] Neil Immerman,et al. Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[9] Y. Gurevich. On Finite Model Theory , 1990 .

[10] J. Büchi. Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[11] Ronald Fagin,et al. Monadic generalized spectra , 1975, Math. Log. Q..

[12] Antonio Restivo,et al. Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems , 1994, STACS.