Electric boolean games are compact representations of games where the players have qualitative objectives described by LTL formulae and have limited …

We consider the structure of aperiodic points in $\mathbb Z^2$-subshifts, and in particular the positions at which they fail to be periodic. We prove…

The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted wit…

The purpose of this section is to prove a partial converse to Theorem 2.1: a subshift X for which the two problems involved are equivalent, however complex they are.

This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, th…

Non standard Analysis is an area of Mathematics dealing with notions of infinitesimal and infinitely large numbers, in which many statements from cla…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account