SearcharxivSearch

arXiv subjects

Bastien Laboureix

Publications and source records attributed to Bastien Laboureix.

2 recordsLinked to original sources

Statures and Sobrification Ranks of Noetherian Spaces

There is a rich theory of maximal order types of well-partial-orders (wpos), pioneered by de Jongh and Parikh (1977) and Schmidt (1981). Every wpo is Noetherian in its Alexandroff topology, and there are more; this prompts us to investigate an analogue of that theory in the wider context of Noetherian spaces. The notion of maximal order type does not seem to have a direct analogue in Noetherian spaces per se, but the equivalent notion of stature, investigated by Blass and Gurevich (2008) does: we define the stature $||X||$ of a Noetherian space $X$ as the ordinal rank of its poset of proper closed subsets. We obtain formulas for statures of sums, of products, of the space of words on a space $X$, of the space of finite multisets on $X$, in particular. They confirm previously known formulas on wpos, and extend them to Noetherian spaces. The proofs are, by necessity, rather different from their wpo counterparts, and rely on explicit characterizations of the sobrifications of the corresponding spaces, as obtained by Finkel and the first author (2020). We also give formulas for the statures of some natural Noetherian spaces that do not arise from wpos: spaces with the cofinite topology, Hoare powerspaces, powersets, and spaces of words on $X$ with the so-called prefix topology. Finally, because our proofs require it, and also because of its independent interest, we give formulas for the ordinal ranks of the sobrifications of each of those spaces, which we call their sobrification ranks.

math.GN

Keyboards as a new model of computation

We introduce a new formalisation of languages, called keyboards. We consider a set of elementary operations (writing/erasing a letter, going to the right or to the left,...) and we define a keyboard as a set of finite sequences of such operations, called keys. The corresponding language is the set of words obtained by applying some sequence of those keys. Unlike classical models of computation, every key can be applied anytime. We define various classes of languages based on different sets of elementary operations, and compare their expressive powers. We also compare them to well-known classes of languages (Chomsky hierarchy). We obtain a strict hierarchy of languages, whose expressivity is orthogonal to the one of the aforementionned classical models. -- Nous introduisons une nouvelle représentation de langages, les claviers. On se munit d'un ensemble d'opérations élémentaires (ajout, effacement d'une lettre, déplacement à droite, à gauche, ...), et on définit un clavier comme un ensemble de suites finies d'opérations élémentaires, appelées touches. Son langage sera l'ensemble des mots obtenus en appliquant une suite quelconque de touches. Contrairement à des modèles de calcul classiques, toutes les touches peuvent être appliquées à tout moment. En premier lieu nous définissons différentes classes de claviers en faisant varier l'ensemble des opérations élémentaires autorisées, et nous comparons l'expressivité des classes de langages obtenues. Nous comparons également ces classes à la hiérarchie de Chomsky. Nous obtenons que toutes les classes étudiées sont différentes, et nous caractérisons les classes inclues dans les rationnels et les algébriques. L'expressivité des claviers semble orthogonale à celle des modèles évoqués précédemment.

cs.FL