Skip to Main content Skip to Navigation

Automates infinis, logiques et langages

Abstract : This thesis contributes to the study of families of fi nitely presented in finite graphs. We investigate their logical properties as well as the languages which are associated to them. We focus our attention on the infi nite graphs associated to higher-order pushdown automata. Our first contribution is the defi nition of a notion of regularity for higher-order pushdown stacks. We show that this notion shares similar properties with the notion of regularity on words: closure under complementation, deterministic and complete finite state acceptors and characterization by monadic second-order logic. We show a tight link between higher-order pushdown automata and the regular sets of higher-order pushdown stacks. Our second contribution is the study of the in finite graphs associated to higher-order pushdown automata. We give various equivalent characterizations of these graphs and therefore establish the robustness of these families of in finite graphs.
Document type :
Complete list of metadata
Contributor : Arnaud Carayol <>
Submitted on : Monday, October 3, 2011 - 3:02:46 PM
Last modification on : Wednesday, February 3, 2021 - 7:54:26 AM
Long-term archiving on: : Wednesday, January 4, 2012 - 2:28:28 AM


  • HAL Id : tel-00628513, version 1



Arnaud Carayol. Automates infinis, logiques et langages. Informatique [cs]. Université Rennes 1, 2006. Français. ⟨tel-00628513⟩



Record views


Files downloads