The model theory of finite structures is intimately connected to various fields in computer
science, including complexity theory, databases, and verification. In particular, there is a …

The work at hand studies the possibilities and limitations of the use of finite automata in the
description of infinite structures. An automatic presentation of a countable structure consists …

Path-automatic specifications are rational presentations of sets of finite or infinite graphs. A
specification is made of a regular set of paths and rational relations on this set. Each action …

We investigate families of infinite automata for context-sensitive languages. An infinite
automaton is an infinite labeled graph with two sets of initial and final vertices. Its language …

Rational graphs are a family of graphs defined using labelled rational transducers. Unlike
automatic graphs (defined using synchronized transducers) the first order theory of these …

A natural way to describe a family of languages is to use rational transformations from a
generator. From these transformations, Ginsburg and Greibach have defined the Abstract …

A special kind of codes with bounded deciphering delay, called k-comma-free codes, is
considered. The advantage in using these codes is that the decoding can begin “anywhere” …

Automatic graphs are possibly infinite graphs with a rational presentation by finite automata;
they include grids as a particular case, and Sénizergues has shown in a seminal work that …

Cette thèse s' inscrit dans l'étude de familles de graphes infinis de présentation finie, de
leurs propriétés structurelles, ainsi que des comparaisons entre ces familles. Étant donné un …

Verification of infinite state systems Page 1 Introduction Basic results and techniques for MSO
Context-free and prefix-recognizable graphs Verification of infinite state systems Angelo …