This thesis studies the structures with decidable monadic second-ordertheory, and in particular the pushdown hierarchy. The latter can bedefined as the family for n of pushdown graphs with n timesimbricated stacks ; another definition is by graph transformations. Westudy the example of ordinals. We show that ordinals smaller that ε₀ are in the hierarchy, along with graphs called "covering graphs", which carry more data than ordinals. We show then the converse : allordinals of the hierarchy are smaller than ε₀. This result uses thefact that linear orders of a level are actually isomorphic to thestructure of leaves of deterministic trees by lexicographic ordering, at the same level. More generally, we obtain a characterisation ofscattered lin...
We compare classes of finite relational structures via monadic second-ordertransductions. More preci...
We study the first-order model checking problem on two generalisations of pushdown graphs. The first...
We study the complexity of automatic structures via well-established concepts from both logic and mo...
This thesis studies the structures with decidable monadic second-ordertheory, and in particular the ...
The paper focuses on the structure of fundamental sequences of ordinals smaller than $e$. A first re...
AbstractThe monadic second-order quantifier alternation hierarchy over the class of finite graphs is...
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton...
We show that the monadic second-order quantifier alternation hierarchy over finite directed graphs a...
Our concern in the thesis is in the study of orders, through the analysis of complexity within rewri...
Half-line innite graphs may be considered as words; the Caucal hierarchy therefore oers unex-plored ...
This thesis contributes to the study of families of fi nitely presented in finite graphs. We investi...
AbstractWe investigate the structure of graphs in the Caucal hierarchy. We provide criteria concerni...
AbstractGraphs are finite and handled as relational structures. We give some answers to the followin...
International audienceHigher-order pushdown systems and ground tree rewriting systems can be seen as...
A hierarchical approach to the decomposition of graphs is introduced which is related to the notion ...
We compare classes of finite relational structures via monadic second-ordertransductions. More preci...
We study the first-order model checking problem on two generalisations of pushdown graphs. The first...
We study the complexity of automatic structures via well-established concepts from both logic and mo...
This thesis studies the structures with decidable monadic second-ordertheory, and in particular the ...
The paper focuses on the structure of fundamental sequences of ordinals smaller than $e$. A first re...
AbstractThe monadic second-order quantifier alternation hierarchy over the class of finite graphs is...
Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton...
We show that the monadic second-order quantifier alternation hierarchy over finite directed graphs a...
Our concern in the thesis is in the study of orders, through the analysis of complexity within rewri...
Half-line innite graphs may be considered as words; the Caucal hierarchy therefore oers unex-plored ...
This thesis contributes to the study of families of fi nitely presented in finite graphs. We investi...
AbstractWe investigate the structure of graphs in the Caucal hierarchy. We provide criteria concerni...
AbstractGraphs are finite and handled as relational structures. We give some answers to the followin...
International audienceHigher-order pushdown systems and ground tree rewriting systems can be seen as...
A hierarchical approach to the decomposition of graphs is introduced which is related to the notion ...
We compare classes of finite relational structures via monadic second-ordertransductions. More preci...
We study the first-order model checking problem on two generalisations of pushdown graphs. The first...
We study the complexity of automatic structures via well-established concepts from both logic and mo...