Posts classified under: Amacc

We carry on the study initiated by Bérard et al. of the reactive synthesis problem for distributed systems with an unbounded number of participants interacting with an uncontrollable environment. Executions of those systems are modeled by data words (i.e. finite or infinite words were positions are labeled by an unbounded alphabet), and specifications are given … Continue reading Séminaire Algorithmique « Synthesis for fragments of first-order logic on data words », Julien Grange (LACL, Univ. Paris-Est Créteil)

History-deterministic automata are intermediary between deterministic and nondeterministic ones, and have been the object of thorough study in the last decade. They offer a way to get a better grasp of the power of nondeterminism, by allowing only some aspects of it: nondeterministic choices are allowed to depend on the past of the computation but … Continue reading Séminaire Algorithmique « History-deterministic and explorable automata », Denis Kuperberg (LIP, ENS Lyon)

A classical result from the theory of formal languages, the Myhill-Nerode theorem, gives a necessary and sufficient condition in terms of congruence classes for a language to be regular. In this talk, we try to adapt this result to the case of subshifts, in which we consider potentially multidimensional infinite configurations rather than finite words. … Continue reading Séminaire Algorithmique : « Computability of extender sets in multidimensional subshifts », Léo Paviet Salomon (GREYC, Caen)