The closure of Monadic NP (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Extending formal language hierarchies to higher dimensions
ACM Computing Surveys (CSUR)
Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures
Theoretical Computer Science
A Toolkit for First Order Extensions of Monadic Games
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
The monadic quantifier alternation hierarchy over grids and graphs
Information and Computation - Special issue: LICS'97
Message-passing automata are expressively equivalent to EMSO logic
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Tiling recognizable two-dimensional languages
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Recognizable vs. regular picture languages
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Propositional dynamic logic for message-passing systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Automata on directed graphs: edge versus vertex marking
ICGT'06 Proceedings of the Third international conference on Graph Transformations
The Complexity of Model Checking Multi-stack Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We show that in monadic second-order logic over finite directed graphs, a strict hierarchy of expressiveness is obtained by increasing the (second-order) quantifier alternation depth of formulas. Thus, the ``monadic analogue'' of the polynomial hierarchy is found to be strict, which solves a problem of Fagin. The proof is based on automata theoretic concepts (rather than Ehrenfeucht-Fraiss'e games) and starts from a restricted class of graph-like structures, namely finite two-dimensional grids. We investigate monadic second-order definable sets of grids where the width of grids is a function of the height. In this context, the infiniteness of the quantifier alternation hierarchy is witnessed by n-fold exponential functions for increasing n. It is notable that these witness sets of the monadic hierarchy all belong to the complexity class NP, the first level of the polynomial hierarchy.